./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.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_74e9a8a3-0e28-4934-ba47-1343a6e3177b/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_74e9a8a3-0e28-4934-ba47-1343a6e3177b/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_74e9a8a3-0e28-4934-ba47-1343a6e3177b/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_74e9a8a3-0e28-4934-ba47-1343a6e3177b/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c -s /tmp/vcloud-vcloud-master/worker/run_dir_74e9a8a3-0e28-4934-ba47-1343a6e3177b/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_74e9a8a3-0e28-4934-ba47-1343a6e3177b/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 0f7cb1fb9d530fed5cffc0369d2ffc038bc6f50c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 10:54:36,293 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 10:54:36,295 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 10:54:36,304 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 10:54:36,304 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 10:54:36,305 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 10:54:36,306 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 10:54:36,307 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 10:54:36,309 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 10:54:36,309 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 10:54:36,310 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 10:54:36,311 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 10:54:36,311 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 10:54:36,312 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 10:54:36,312 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 10:54:36,313 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 10:54:36,314 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 10:54:36,315 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 10:54:36,316 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 10:54:36,318 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 10:54:36,319 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 10:54:36,319 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 10:54:36,320 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 10:54:36,321 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 10:54:36,322 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 10:54:36,323 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 10:54:36,323 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 10:54:36,323 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 10:54:36,323 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 10:54:36,324 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 10:54:36,324 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 10:54:36,325 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 10:54:36,325 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 10:54:36,326 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 10:54:36,326 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 10:54:36,326 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 10:54:36,327 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 10:54:36,327 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 10:54:36,327 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 10:54:36,328 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 10:54:36,328 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 10:54:36,329 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_74e9a8a3-0e28-4934-ba47-1343a6e3177b/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 10:54:36,339 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 10:54:36,339 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 10:54:36,339 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 10:54:36,339 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 10:54:36,339 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 10:54:36,340 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 10:54:36,340 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 10:54:36,340 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 10:54:36,340 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 10:54:36,340 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 10:54:36,340 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 10:54:36,340 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 10:54:36,340 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 10:54:36,340 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 10:54:36,341 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 10:54:36,341 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 10:54:36,341 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 10:54:36,341 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 10:54:36,341 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 10:54:36,341 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 10:54:36,342 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 10:54:36,342 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 10:54:36,342 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 10:54:36,342 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 10:54:36,342 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 10:54:36,342 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 10:54:36,342 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 10:54:36,342 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 10:54:36,343 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 10:54:36,343 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 10:54:36,343 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 10:54:36,343 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 10:54:36,343 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 10:54:36,343 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 10:54:36,343 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 10:54:36,344 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 10:54:36,344 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 10:54:36,344 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 10:54:36,344 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 10:54:36,344 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 10:54:36,344 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_74e9a8a3-0e28-4934-ba47-1343a6e3177b/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 -> 0f7cb1fb9d530fed5cffc0369d2ffc038bc6f50c [2019-12-07 10:54:36,450 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 10:54:36,460 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 10:54:36,463 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 10:54:36,464 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 10:54:36,465 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 10:54:36,465 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_74e9a8a3-0e28-4934-ba47-1343a6e3177b/bin/utaipan/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-12-07 10:54:36,501 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_74e9a8a3-0e28-4934-ba47-1343a6e3177b/bin/utaipan/data/fa96083de/b2a446a1a64e4156bb9609184dd0f7ba/FLAG9656ec132 [2019-12-07 10:54:36,971 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 10:54:36,972 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_74e9a8a3-0e28-4934-ba47-1343a6e3177b/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-12-07 10:54:36,979 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_74e9a8a3-0e28-4934-ba47-1343a6e3177b/bin/utaipan/data/fa96083de/b2a446a1a64e4156bb9609184dd0f7ba/FLAG9656ec132 [2019-12-07 10:54:37,486 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_74e9a8a3-0e28-4934-ba47-1343a6e3177b/bin/utaipan/data/fa96083de/b2a446a1a64e4156bb9609184dd0f7ba [2019-12-07 10:54:37,489 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 10:54:37,490 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 10:54:37,491 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 10:54:37,491 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 10:54:37,494 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 10:54:37,494 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:54:37" (1/1) ... [2019-12-07 10:54:37,496 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17b2f2d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:54:37, skipping insertion in model container [2019-12-07 10:54:37,496 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 10:54:37" (1/1) ... [2019-12-07 10:54:37,502 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 10:54:37,528 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 10:54:37,701 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:54:37,706 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 10:54:37,741 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 10:54:37,753 INFO L208 MainTranslator]: Completed translation [2019-12-07 10:54:37,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:54:37 WrapperNode [2019-12-07 10:54:37,754 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 10:54:37,754 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 10:54:37,754 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 10:54:37,755 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 10:54:37,760 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:54:37" (1/1) ... [2019-12-07 10:54:37,768 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:54:37" (1/1) ... [2019-12-07 10:54:37,805 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 10:54:37,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 10:54:37,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 10:54:37,806 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 10:54:37,812 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:54:37" (1/1) ... [2019-12-07 10:54:37,812 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:54:37" (1/1) ... [2019-12-07 10:54:37,818 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:54:37" (1/1) ... [2019-12-07 10:54:37,818 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:54:37" (1/1) ... [2019-12-07 10:54:37,834 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:54:37" (1/1) ... [2019-12-07 10:54:37,847 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:54:37" (1/1) ... [2019-12-07 10:54:37,851 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:54:37" (1/1) ... [2019-12-07 10:54:37,856 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 10:54:37,857 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 10:54:37,857 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 10:54:37,857 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 10:54:37,857 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:54:37" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74e9a8a3-0e28-4934-ba47-1343a6e3177b/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 10:54:37,900 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 10:54:37,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 10:54:39,457 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 10:54:39,457 INFO L287 CfgBuilder]: Removed 173 assume(true) statements. [2019-12-07 10:54:39,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:54:39 BoogieIcfgContainer [2019-12-07 10:54:39,459 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 10:54:39,460 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 10:54:39,460 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 10:54:39,463 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 10:54:39,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 10:54:37" (1/3) ... [2019-12-07 10:54:39,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b483a25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:54:39, skipping insertion in model container [2019-12-07 10:54:39,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 10:54:37" (2/3) ... [2019-12-07 10:54:39,464 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b483a25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 10:54:39, skipping insertion in model container [2019-12-07 10:54:39,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:54:39" (3/3) ... [2019-12-07 10:54:39,466 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2019-12-07 10:54:39,475 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 10:54:39,482 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 37 error locations. [2019-12-07 10:54:39,491 INFO L249 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2019-12-07 10:54:39,511 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 10:54:39,512 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 10:54:39,512 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 10:54:39,512 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 10:54:39,512 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 10:54:39,512 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 10:54:39,512 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 10:54:39,512 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 10:54:39,532 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states. [2019-12-07 10:54:39,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 10:54:39,538 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:54:39,539 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:54:39,540 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 10:54:39,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:54:39,545 INFO L82 PathProgramCache]: Analyzing trace with hash -609258208, now seen corresponding path program 1 times [2019-12-07 10:54:39,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:54:39,552 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278666546] [2019-12-07 10:54:39,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:54:39,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:54:39,670 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 10:54:39,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278666546] [2019-12-07 10:54:39,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:54:39,671 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:54:39,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730490202] [2019-12-07 10:54:39,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:54:39,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:54:39,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:54:39,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:54:39,685 INFO L87 Difference]: Start difference. First operand 334 states. Second operand 3 states. [2019-12-07 10:54:39,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:54:39,846 INFO L93 Difference]: Finished difference Result 826 states and 1258 transitions. [2019-12-07 10:54:39,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:54:39,847 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-12-07 10:54:39,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:54:39,858 INFO L225 Difference]: With dead ends: 826 [2019-12-07 10:54:39,858 INFO L226 Difference]: Without dead ends: 491 [2019-12-07 10:54:39,862 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 10:54:39,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-12-07 10:54:39,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 297. [2019-12-07 10:54:39,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-12-07 10:54:39,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 418 transitions. [2019-12-07 10:54:39,902 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 418 transitions. Word has length 8 [2019-12-07 10:54:39,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:54:39,902 INFO L462 AbstractCegarLoop]: Abstraction has 297 states and 418 transitions. [2019-12-07 10:54:39,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:54:39,902 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 418 transitions. [2019-12-07 10:54:39,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 10:54:39,903 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:54:39,903 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:54:39,903 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 10:54:39,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:54:39,904 INFO L82 PathProgramCache]: Analyzing trace with hash 796877198, now seen corresponding path program 1 times [2019-12-07 10:54:39,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:54:39,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093828573] [2019-12-07 10:54:39,904 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:54:39,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:54:39,926 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 10:54:39,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093828573] [2019-12-07 10:54:39,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:54:39,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:54:39,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845586849] [2019-12-07 10:54:39,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:54:39,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:54:39,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:54:39,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:54:39,928 INFO L87 Difference]: Start difference. First operand 297 states and 418 transitions. Second operand 3 states. [2019-12-07 10:54:39,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:54:39,964 INFO L93 Difference]: Finished difference Result 732 states and 1023 transitions. [2019-12-07 10:54:39,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:54:39,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-07 10:54:39,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:54:39,967 INFO L225 Difference]: With dead ends: 732 [2019-12-07 10:54:39,968 INFO L226 Difference]: Without dead ends: 436 [2019-12-07 10:54:39,969 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 10:54:39,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-12-07 10:54:39,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 278. [2019-12-07 10:54:39,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2019-12-07 10:54:39,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 388 transitions. [2019-12-07 10:54:39,981 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 388 transitions. Word has length 9 [2019-12-07 10:54:39,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:54:39,982 INFO L462 AbstractCegarLoop]: Abstraction has 278 states and 388 transitions. [2019-12-07 10:54:39,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:54:39,982 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 388 transitions. [2019-12-07 10:54:39,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-07 10:54:39,982 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:54:39,982 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:54:39,983 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 10:54:39,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:54:39,983 INFO L82 PathProgramCache]: Analyzing trace with hash 868991221, now seen corresponding path program 1 times [2019-12-07 10:54:39,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:54:39,983 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911168154] [2019-12-07 10:54:39,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:54:39,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:54:40,005 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 10:54:40,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911168154] [2019-12-07 10:54:40,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:54:40,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 10:54:40,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256484907] [2019-12-07 10:54:40,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:54:40,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:54:40,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:54:40,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:54:40,006 INFO L87 Difference]: Start difference. First operand 278 states and 388 transitions. Second operand 3 states. [2019-12-07 10:54:40,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:54:40,041 INFO L93 Difference]: Finished difference Result 820 states and 1145 transitions. [2019-12-07 10:54:40,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:54:40,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-07 10:54:40,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:54:40,045 INFO L225 Difference]: With dead ends: 820 [2019-12-07 10:54:40,045 INFO L226 Difference]: Without dead ends: 549 [2019-12-07 10:54:40,046 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 10:54:40,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2019-12-07 10:54:40,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 282. [2019-12-07 10:54:40,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-12-07 10:54:40,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 392 transitions. [2019-12-07 10:54:40,060 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 392 transitions. Word has length 11 [2019-12-07 10:54:40,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:54:40,060 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 392 transitions. [2019-12-07 10:54:40,060 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:54:40,060 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 392 transitions. [2019-12-07 10:54:40,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 10:54:40,061 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:54:40,061 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:54:40,062 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 10:54:40,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:54:40,062 INFO L82 PathProgramCache]: Analyzing trace with hash 37809907, now seen corresponding path program 1 times [2019-12-07 10:54:40,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:54:40,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340532801] [2019-12-07 10:54:40,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:54:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:54:40,094 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 10:54:40,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340532801] [2019-12-07 10:54:40,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:54:40,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:54:40,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800269632] [2019-12-07 10:54:40,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:54:40,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:54:40,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:54:40,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:54:40,095 INFO L87 Difference]: Start difference. First operand 282 states and 392 transitions. Second operand 3 states. [2019-12-07 10:54:40,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:54:40,107 INFO L93 Difference]: Finished difference Result 435 states and 599 transitions. [2019-12-07 10:54:40,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:54:40,108 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-07 10:54:40,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:54:40,110 INFO L225 Difference]: With dead ends: 435 [2019-12-07 10:54:40,110 INFO L226 Difference]: Without dead ends: 282 [2019-12-07 10:54:40,111 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 10:54:40,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2019-12-07 10:54:40,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 282. [2019-12-07 10:54:40,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-12-07 10:54:40,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 389 transitions. [2019-12-07 10:54:40,120 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 389 transitions. Word has length 15 [2019-12-07 10:54:40,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:54:40,120 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 389 transitions. [2019-12-07 10:54:40,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:54:40,120 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 389 transitions. [2019-12-07 10:54:40,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 10:54:40,121 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:54:40,121 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 10:54:40,121 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 10:54:40,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:54:40,122 INFO L82 PathProgramCache]: Analyzing trace with hash 347930514, now seen corresponding path program 1 times [2019-12-07 10:54:40,122 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:54:40,122 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935489181] [2019-12-07 10:54:40,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:54:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:54:40,156 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 10:54:40,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935489181] [2019-12-07 10:54:40,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:54:40,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:54:40,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236931378] [2019-12-07 10:54:40,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:54:40,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:54:40,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:54:40,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:54:40,157 INFO L87 Difference]: Start difference. First operand 282 states and 389 transitions. Second operand 4 states. [2019-12-07 10:54:40,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:54:40,196 INFO L93 Difference]: Finished difference Result 714 states and 980 transitions. [2019-12-07 10:54:40,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:54:40,197 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 10:54:40,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:54:40,199 INFO L225 Difference]: With dead ends: 714 [2019-12-07 10:54:40,199 INFO L226 Difference]: Without dead ends: 440 [2019-12-07 10:54:40,200 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 10:54:40,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2019-12-07 10:54:40,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 282. [2019-12-07 10:54:40,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-12-07 10:54:40,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 388 transitions. [2019-12-07 10:54:40,206 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 388 transitions. Word has length 16 [2019-12-07 10:54:40,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:54:40,206 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 388 transitions. [2019-12-07 10:54:40,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:54:40,207 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 388 transitions. [2019-12-07 10:54:40,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 10:54:40,207 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:54:40,207 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 10:54:40,207 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 10:54:40,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:54:40,208 INFO L82 PathProgramCache]: Analyzing trace with hash -2003639412, now seen corresponding path program 1 times [2019-12-07 10:54:40,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:54:40,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863744229] [2019-12-07 10:54:40,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:54:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:54:40,229 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 10:54:40,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863744229] [2019-12-07 10:54:40,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:54:40,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:54:40,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914879452] [2019-12-07 10:54:40,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:54:40,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:54:40,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:54:40,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:54:40,231 INFO L87 Difference]: Start difference. First operand 282 states and 388 transitions. Second operand 3 states. [2019-12-07 10:54:40,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:54:40,304 INFO L93 Difference]: Finished difference Result 695 states and 963 transitions. [2019-12-07 10:54:40,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:54:40,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 10:54:40,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:54:40,307 INFO L225 Difference]: With dead ends: 695 [2019-12-07 10:54:40,307 INFO L226 Difference]: Without dead ends: 424 [2019-12-07 10:54:40,307 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 10:54:40,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2019-12-07 10:54:40,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 257. [2019-12-07 10:54:40,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2019-12-07 10:54:40,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 348 transitions. [2019-12-07 10:54:40,313 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 348 transitions. Word has length 18 [2019-12-07 10:54:40,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:54:40,314 INFO L462 AbstractCegarLoop]: Abstraction has 257 states and 348 transitions. [2019-12-07 10:54:40,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:54:40,314 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 348 transitions. [2019-12-07 10:54:40,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 10:54:40,314 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:54:40,314 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 10:54:40,315 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 10:54:40,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:54:40,315 INFO L82 PathProgramCache]: Analyzing trace with hash -61043776, now seen corresponding path program 1 times [2019-12-07 10:54:40,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:54:40,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742476342] [2019-12-07 10:54:40,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:54:40,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:54:40,333 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 10:54:40,333 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742476342] [2019-12-07 10:54:40,333 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:54:40,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:54:40,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146584848] [2019-12-07 10:54:40,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:54:40,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:54:40,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:54:40,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:54:40,334 INFO L87 Difference]: Start difference. First operand 257 states and 348 transitions. Second operand 3 states. [2019-12-07 10:54:40,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:54:40,362 INFO L93 Difference]: Finished difference Result 633 states and 858 transitions. [2019-12-07 10:54:40,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:54:40,363 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-07 10:54:40,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:54:40,364 INFO L225 Difference]: With dead ends: 633 [2019-12-07 10:54:40,365 INFO L226 Difference]: Without dead ends: 387 [2019-12-07 10:54:40,365 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 10:54:40,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-12-07 10:54:40,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 241. [2019-12-07 10:54:40,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-12-07 10:54:40,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 322 transitions. [2019-12-07 10:54:40,370 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 322 transitions. Word has length 18 [2019-12-07 10:54:40,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:54:40,371 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 322 transitions. [2019-12-07 10:54:40,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:54:40,371 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 322 transitions. [2019-12-07 10:54:40,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 10:54:40,372 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:54:40,372 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 10:54:40,372 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 10:54:40,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:54:40,372 INFO L82 PathProgramCache]: Analyzing trace with hash 185575570, now seen corresponding path program 1 times [2019-12-07 10:54:40,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:54:40,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422558818] [2019-12-07 10:54:40,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:54:40,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:54:40,403 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 10:54:40,403 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422558818] [2019-12-07 10:54:40,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:54:40,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:54:40,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552906711] [2019-12-07 10:54:40,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:54:40,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:54:40,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:54:40,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:54:40,405 INFO L87 Difference]: Start difference. First operand 241 states and 322 transitions. Second operand 4 states. [2019-12-07 10:54:40,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:54:40,438 INFO L93 Difference]: Finished difference Result 609 states and 816 transitions. [2019-12-07 10:54:40,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:54:40,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-07 10:54:40,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:54:40,441 INFO L225 Difference]: With dead ends: 609 [2019-12-07 10:54:40,441 INFO L226 Difference]: Without dead ends: 387 [2019-12-07 10:54:40,442 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 10:54:40,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2019-12-07 10:54:40,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 241. [2019-12-07 10:54:40,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-12-07 10:54:40,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 321 transitions. [2019-12-07 10:54:40,450 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 321 transitions. Word has length 27 [2019-12-07 10:54:40,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:54:40,450 INFO L462 AbstractCegarLoop]: Abstraction has 241 states and 321 transitions. [2019-12-07 10:54:40,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:54:40,450 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 321 transitions. [2019-12-07 10:54:40,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-07 10:54:40,451 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:54:40,451 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 10:54:40,451 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 10:54:40,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:54:40,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1033508625, now seen corresponding path program 1 times [2019-12-07 10:54:40,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:54:40,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051800389] [2019-12-07 10:54:40,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:54:40,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:54:40,478 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 10:54:40,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051800389] [2019-12-07 10:54:40,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:54:40,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:54:40,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354932968] [2019-12-07 10:54:40,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:54:40,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:54:40,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:54:40,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:54:40,480 INFO L87 Difference]: Start difference. First operand 241 states and 321 transitions. Second operand 3 states. [2019-12-07 10:54:40,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:54:40,528 INFO L93 Difference]: Finished difference Result 587 states and 790 transitions. [2019-12-07 10:54:40,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:54:40,528 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-07 10:54:40,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:54:40,530 INFO L225 Difference]: With dead ends: 587 [2019-12-07 10:54:40,530 INFO L226 Difference]: Without dead ends: 368 [2019-12-07 10:54:40,530 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 10:54:40,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-12-07 10:54:40,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 224. [2019-12-07 10:54:40,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-12-07 10:54:40,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 295 transitions. [2019-12-07 10:54:40,535 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 295 transitions. Word has length 29 [2019-12-07 10:54:40,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:54:40,536 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 295 transitions. [2019-12-07 10:54:40,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:54:40,536 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 295 transitions. [2019-12-07 10:54:40,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-07 10:54:40,536 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:54:40,536 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 10:54:40,537 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 10:54:40,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:54:40,537 INFO L82 PathProgramCache]: Analyzing trace with hash 92119484, now seen corresponding path program 1 times [2019-12-07 10:54:40,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:54:40,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567868515] [2019-12-07 10:54:40,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:54:40,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:54:40,556 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 10:54:40,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567868515] [2019-12-07 10:54:40,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:54:40,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:54:40,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567568726] [2019-12-07 10:54:40,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:54:40,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:54:40,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:54:40,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:54:40,558 INFO L87 Difference]: Start difference. First operand 224 states and 295 transitions. Second operand 3 states. [2019-12-07 10:54:40,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:54:40,604 INFO L93 Difference]: Finished difference Result 502 states and 670 transitions. [2019-12-07 10:54:40,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:54:40,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-12-07 10:54:40,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:54:40,606 INFO L225 Difference]: With dead ends: 502 [2019-12-07 10:54:40,606 INFO L226 Difference]: Without dead ends: 300 [2019-12-07 10:54:40,607 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 10:54:40,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-12-07 10:54:40,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 208. [2019-12-07 10:54:40,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-12-07 10:54:40,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 267 transitions. [2019-12-07 10:54:40,614 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 267 transitions. Word has length 30 [2019-12-07 10:54:40,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:54:40,615 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 267 transitions. [2019-12-07 10:54:40,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:54:40,615 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 267 transitions. [2019-12-07 10:54:40,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-07 10:54:40,616 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:54:40,616 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 10:54:40,616 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 10:54:40,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:54:40,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1485064823, now seen corresponding path program 1 times [2019-12-07 10:54:40,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:54:40,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914752043] [2019-12-07 10:54:40,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:54:40,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:54:40,647 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 10:54:40,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914752043] [2019-12-07 10:54:40,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:54:40,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:54:40,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967833671] [2019-12-07 10:54:40,648 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:54:40,648 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:54:40,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:54:40,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:54:40,649 INFO L87 Difference]: Start difference. First operand 208 states and 267 transitions. Second operand 4 states. [2019-12-07 10:54:40,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:54:40,677 INFO L93 Difference]: Finished difference Result 520 states and 676 transitions. [2019-12-07 10:54:40,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:54:40,677 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-07 10:54:40,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:54:40,679 INFO L225 Difference]: With dead ends: 520 [2019-12-07 10:54:40,679 INFO L226 Difference]: Without dead ends: 344 [2019-12-07 10:54:40,679 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 10:54:40,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2019-12-07 10:54:40,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 208. [2019-12-07 10:54:40,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-12-07 10:54:40,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 266 transitions. [2019-12-07 10:54:40,684 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 266 transitions. Word has length 40 [2019-12-07 10:54:40,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:54:40,685 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 266 transitions. [2019-12-07 10:54:40,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:54:40,685 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 266 transitions. [2019-12-07 10:54:40,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 10:54:40,685 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:54:40,686 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 10:54:40,686 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 10:54:40,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:54:40,686 INFO L82 PathProgramCache]: Analyzing trace with hash -1984685826, now seen corresponding path program 1 times [2019-12-07 10:54:40,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:54:40,686 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827772283] [2019-12-07 10:54:40,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:54:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:54:40,708 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 10:54:40,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827772283] [2019-12-07 10:54:40,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:54:40,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:54:40,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393852641] [2019-12-07 10:54:40,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:54:40,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:54:40,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:54:40,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:54:40,709 INFO L87 Difference]: Start difference. First operand 208 states and 266 transitions. Second operand 3 states. [2019-12-07 10:54:40,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:54:40,739 INFO L93 Difference]: Finished difference Result 423 states and 566 transitions. [2019-12-07 10:54:40,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:54:40,739 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-12-07 10:54:40,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:54:40,741 INFO L225 Difference]: With dead ends: 423 [2019-12-07 10:54:40,741 INFO L226 Difference]: Without dead ends: 250 [2019-12-07 10:54:40,742 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 10:54:40,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2019-12-07 10:54:40,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 168. [2019-12-07 10:54:40,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2019-12-07 10:54:40,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 216 transitions. [2019-12-07 10:54:40,748 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 216 transitions. Word has length 42 [2019-12-07 10:54:40,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:54:40,748 INFO L462 AbstractCegarLoop]: Abstraction has 168 states and 216 transitions. [2019-12-07 10:54:40,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:54:40,749 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 216 transitions. [2019-12-07 10:54:40,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-07 10:54:40,749 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:54:40,749 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 10:54:40,750 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 10:54:40,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:54:40,750 INFO L82 PathProgramCache]: Analyzing trace with hash 360453595, now seen corresponding path program 1 times [2019-12-07 10:54:40,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:54:40,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956709315] [2019-12-07 10:54:40,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:54:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:54:40,779 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 10:54:40,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956709315] [2019-12-07 10:54:40,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:54:40,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:54:40,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76593626] [2019-12-07 10:54:40,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:54:40,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:54:40,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:54:40,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:54:40,781 INFO L87 Difference]: Start difference. First operand 168 states and 216 transitions. Second operand 3 states. [2019-12-07 10:54:40,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:54:40,799 INFO L93 Difference]: Finished difference Result 277 states and 364 transitions. [2019-12-07 10:54:40,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:54:40,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-12-07 10:54:40,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:54:40,800 INFO L225 Difference]: With dead ends: 277 [2019-12-07 10:54:40,800 INFO L226 Difference]: Without dead ends: 144 [2019-12-07 10:54:40,801 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 10:54:40,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-12-07 10:54:40,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-12-07 10:54:40,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-12-07 10:54:40,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 182 transitions. [2019-12-07 10:54:40,804 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 182 transitions. Word has length 47 [2019-12-07 10:54:40,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:54:40,805 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 182 transitions. [2019-12-07 10:54:40,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:54:40,805 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 182 transitions. [2019-12-07 10:54:40,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-07 10:54:40,805 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:54:40,805 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 10:54:40,805 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 10:54:40,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:54:40,806 INFO L82 PathProgramCache]: Analyzing trace with hash -719465386, now seen corresponding path program 1 times [2019-12-07 10:54:40,806 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:54:40,806 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274029613] [2019-12-07 10:54:40,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:54:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:54:40,834 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 10:54:40,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274029613] [2019-12-07 10:54:40,834 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:54:40,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:54:40,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547916678] [2019-12-07 10:54:40,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:54:40,835 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:54:40,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:54:40,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:54:40,835 INFO L87 Difference]: Start difference. First operand 144 states and 182 transitions. Second operand 3 states. [2019-12-07 10:54:40,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:54:40,853 INFO L93 Difference]: Finished difference Result 316 states and 409 transitions. [2019-12-07 10:54:40,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:54:40,853 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-12-07 10:54:40,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:54:40,854 INFO L225 Difference]: With dead ends: 316 [2019-12-07 10:54:40,854 INFO L226 Difference]: Without dead ends: 218 [2019-12-07 10:54:40,855 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 10:54:40,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-12-07 10:54:40,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 139. [2019-12-07 10:54:40,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2019-12-07 10:54:40,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 174 transitions. [2019-12-07 10:54:40,859 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 174 transitions. Word has length 50 [2019-12-07 10:54:40,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:54:40,859 INFO L462 AbstractCegarLoop]: Abstraction has 139 states and 174 transitions. [2019-12-07 10:54:40,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:54:40,859 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 174 transitions. [2019-12-07 10:54:40,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-07 10:54:40,859 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:54:40,860 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 10:54:40,860 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 10:54:40,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:54:40,860 INFO L82 PathProgramCache]: Analyzing trace with hash -384951725, now seen corresponding path program 1 times [2019-12-07 10:54:40,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:54:40,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495630850] [2019-12-07 10:54:40,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:54:40,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:54:40,889 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 10:54:40,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495630850] [2019-12-07 10:54:40,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:54:40,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:54:40,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013011098] [2019-12-07 10:54:40,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:54:40,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:54:40,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:54:40,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:54:40,890 INFO L87 Difference]: Start difference. First operand 139 states and 174 transitions. Second operand 3 states. [2019-12-07 10:54:40,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:54:40,908 INFO L93 Difference]: Finished difference Result 306 states and 394 transitions. [2019-12-07 10:54:40,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:54:40,908 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-07 10:54:40,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:54:40,909 INFO L225 Difference]: With dead ends: 306 [2019-12-07 10:54:40,909 INFO L226 Difference]: Without dead ends: 213 [2019-12-07 10:54:40,909 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 10:54:40,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2019-12-07 10:54:40,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 135. [2019-12-07 10:54:40,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-12-07 10:54:40,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 167 transitions. [2019-12-07 10:54:40,914 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 167 transitions. Word has length 52 [2019-12-07 10:54:40,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:54:40,914 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 167 transitions. [2019-12-07 10:54:40,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:54:40,914 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 167 transitions. [2019-12-07 10:54:40,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-07 10:54:40,914 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:54:40,915 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 10:54:40,915 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 10:54:40,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:54:40,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1544244055, now seen corresponding path program 1 times [2019-12-07 10:54:40,915 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:54:40,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816575786] [2019-12-07 10:54:40,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:54:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:54:40,944 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 10:54:40,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816575786] [2019-12-07 10:54:40,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:54:40,945 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:54:40,945 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244394998] [2019-12-07 10:54:40,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:54:40,945 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:54:40,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:54:40,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:54:40,946 INFO L87 Difference]: Start difference. First operand 135 states and 167 transitions. Second operand 3 states. [2019-12-07 10:54:40,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:54:40,961 INFO L93 Difference]: Finished difference Result 222 states and 281 transitions. [2019-12-07 10:54:40,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:54:40,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-07 10:54:40,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:54:40,962 INFO L225 Difference]: With dead ends: 222 [2019-12-07 10:54:40,962 INFO L226 Difference]: Without dead ends: 133 [2019-12-07 10:54:40,963 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 10:54:40,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-12-07 10:54:40,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2019-12-07 10:54:40,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-12-07 10:54:40,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 161 transitions. [2019-12-07 10:54:40,968 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 161 transitions. Word has length 55 [2019-12-07 10:54:40,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:54:40,968 INFO L462 AbstractCegarLoop]: Abstraction has 132 states and 161 transitions. [2019-12-07 10:54:40,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:54:40,969 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 161 transitions. [2019-12-07 10:54:40,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-07 10:54:40,969 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:54:40,969 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 10:54:40,969 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 10:54:40,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:54:40,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1510817918, now seen corresponding path program 1 times [2019-12-07 10:54:40,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:54:40,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137718815] [2019-12-07 10:54:40,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:54:40,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:54:41,006 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 10:54:41,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137718815] [2019-12-07 10:54:41,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:54:41,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 10:54:41,007 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585631007] [2019-12-07 10:54:41,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 10:54:41,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:54:41,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 10:54:41,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 10:54:41,007 INFO L87 Difference]: Start difference. First operand 132 states and 161 transitions. Second operand 3 states. [2019-12-07 10:54:41,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:54:41,014 INFO L93 Difference]: Finished difference Result 235 states and 294 transitions. [2019-12-07 10:54:41,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 10:54:41,015 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-07 10:54:41,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:54:41,016 INFO L225 Difference]: With dead ends: 235 [2019-12-07 10:54:41,016 INFO L226 Difference]: Without dead ends: 149 [2019-12-07 10:54:41,016 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 10:54:41,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-12-07 10:54:41,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 129. [2019-12-07 10:54:41,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-12-07 10:54:41,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 157 transitions. [2019-12-07 10:54:41,022 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 157 transitions. Word has length 59 [2019-12-07 10:54:41,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:54:41,022 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 157 transitions. [2019-12-07 10:54:41,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 10:54:41,023 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 157 transitions. [2019-12-07 10:54:41,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-07 10:54:41,023 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:54:41,023 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 10:54:41,023 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 10:54:41,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:54:41,024 INFO L82 PathProgramCache]: Analyzing trace with hash -2015327076, now seen corresponding path program 1 times [2019-12-07 10:54:41,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:54:41,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508113015] [2019-12-07 10:54:41,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:54:41,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:54:41,058 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 10:54:41,059 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508113015] [2019-12-07 10:54:41,059 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:54:41,059 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:54:41,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239330563] [2019-12-07 10:54:41,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:54:41,060 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:54:41,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:54:41,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:54:41,060 INFO L87 Difference]: Start difference. First operand 129 states and 157 transitions. Second operand 4 states. [2019-12-07 10:54:41,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:54:41,085 INFO L93 Difference]: Finished difference Result 214 states and 265 transitions. [2019-12-07 10:54:41,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:54:41,085 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-12-07 10:54:41,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:54:41,086 INFO L225 Difference]: With dead ends: 214 [2019-12-07 10:54:41,086 INFO L226 Difference]: Without dead ends: 129 [2019-12-07 10:54:41,087 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 10:54:41,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-12-07 10:54:41,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2019-12-07 10:54:41,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-12-07 10:54:41,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 156 transitions. [2019-12-07 10:54:41,091 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 156 transitions. Word has length 62 [2019-12-07 10:54:41,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:54:41,091 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 156 transitions. [2019-12-07 10:54:41,091 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:54:41,091 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 156 transitions. [2019-12-07 10:54:41,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-07 10:54:41,091 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:54:41,091 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 10:54:41,092 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 10:54:41,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:54:41,092 INFO L82 PathProgramCache]: Analyzing trace with hash -1029246134, now seen corresponding path program 1 times [2019-12-07 10:54:41,092 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:54:41,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766415837] [2019-12-07 10:54:41,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:54:41,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:54:41,158 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 10:54:41,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766415837] [2019-12-07 10:54:41,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:54:41,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:54:41,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441810645] [2019-12-07 10:54:41,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:54:41,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:54:41,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:54:41,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:54:41,159 INFO L87 Difference]: Start difference. First operand 129 states and 156 transitions. Second operand 4 states. [2019-12-07 10:54:41,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:54:41,218 INFO L93 Difference]: Finished difference Result 294 states and 359 transitions. [2019-12-07 10:54:41,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:54:41,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-07 10:54:41,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:54:41,219 INFO L225 Difference]: With dead ends: 294 [2019-12-07 10:54:41,219 INFO L226 Difference]: Without dead ends: 211 [2019-12-07 10:54:41,220 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 10:54:41,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-12-07 10:54:41,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 162. [2019-12-07 10:54:41,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2019-12-07 10:54:41,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 192 transitions. [2019-12-07 10:54:41,229 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 192 transitions. Word has length 64 [2019-12-07 10:54:41,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:54:41,229 INFO L462 AbstractCegarLoop]: Abstraction has 162 states and 192 transitions. [2019-12-07 10:54:41,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:54:41,229 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 192 transitions. [2019-12-07 10:54:41,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-07 10:54:41,230 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:54:41,230 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 10:54:41,230 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 10:54:41,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:54:41,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1856393850, now seen corresponding path program 1 times [2019-12-07 10:54:41,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:54:41,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143147405] [2019-12-07 10:54:41,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:54:41,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:54:41,301 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 10:54:41,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143147405] [2019-12-07 10:54:41,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:54:41,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:54:41,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238242291] [2019-12-07 10:54:41,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:54:41,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:54:41,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:54:41,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:54:41,302 INFO L87 Difference]: Start difference. First operand 162 states and 192 transitions. Second operand 4 states. [2019-12-07 10:54:41,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:54:41,344 INFO L93 Difference]: Finished difference Result 272 states and 328 transitions. [2019-12-07 10:54:41,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 10:54:41,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-07 10:54:41,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:54:41,346 INFO L225 Difference]: With dead ends: 272 [2019-12-07 10:54:41,346 INFO L226 Difference]: Without dead ends: 270 [2019-12-07 10:54:41,346 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 10:54:41,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2019-12-07 10:54:41,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 164. [2019-12-07 10:54:41,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-12-07 10:54:41,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 194 transitions. [2019-12-07 10:54:41,355 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 194 transitions. Word has length 75 [2019-12-07 10:54:41,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:54:41,355 INFO L462 AbstractCegarLoop]: Abstraction has 164 states and 194 transitions. [2019-12-07 10:54:41,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:54:41,355 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 194 transitions. [2019-12-07 10:54:41,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-07 10:54:41,356 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:54:41,356 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 10:54:41,356 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 10:54:41,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:54:41,356 INFO L82 PathProgramCache]: Analyzing trace with hash 966881077, now seen corresponding path program 1 times [2019-12-07 10:54:41,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:54:41,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162895162] [2019-12-07 10:54:41,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:54:41,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:54:41,476 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 10:54:41,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162895162] [2019-12-07 10:54:41,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411072883] [2019-12-07 10:54:41,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74e9a8a3-0e28-4934-ba47-1343a6e3177b/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 10:54:41,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:54:41,571 INFO L264 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:54:41,577 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:54:41,633 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 10:54:41,633 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:54:41,663 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 10:54:41,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [235968231] [2019-12-07 10:54:41,681 INFO L159 IcfgInterpreter]: Started Sifa with 73 locations of interest [2019-12-07 10:54:41,681 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:54:41,685 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 10:54:41,690 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 10:54:41,690 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 10:54:45,667 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 10:54:46,108 WARN L192 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 112 [2019-12-07 10:54:46,553 WARN L192 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 113 [2019-12-07 10:54:46,967 WARN L192 SmtUtils]: Spent 350.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 109 [2019-12-07 10:54:47,218 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 83 [2019-12-07 10:54:47,446 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2019-12-07 10:54:47,696 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 85 [2019-12-07 10:54:48,044 WARN L192 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 84 [2019-12-07 10:54:48,428 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 86 [2019-12-07 10:54:49,068 WARN L192 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 101 [2019-12-07 10:54:49,847 WARN L192 SmtUtils]: Spent 684.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2019-12-07 10:54:50,128 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2019-12-07 10:54:50,392 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 82 [2019-12-07 10:54:50,731 WARN L192 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 85 [2019-12-07 10:54:51,017 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 89 [2019-12-07 10:54:51,327 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 91 [2019-12-07 10:54:51,706 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 96 [2019-12-07 10:54:52,206 WARN L192 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 98 [2019-12-07 10:54:53,009 WARN L192 SmtUtils]: Spent 668.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 97 [2019-12-07 10:54:53,626 WARN L192 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 99 [2019-12-07 10:54:53,950 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 91 [2019-12-07 10:54:54,435 WARN L192 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 85 [2019-12-07 10:54:54,934 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 87 [2019-12-07 10:54:55,273 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 91 [2019-12-07 10:54:55,670 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 93 [2019-12-07 10:54:56,107 WARN L192 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 92 [2019-12-07 10:54:56,545 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 94 [2019-12-07 10:54:57,164 WARN L192 SmtUtils]: Spent 452.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 121 [2019-12-07 10:54:57,805 WARN L192 SmtUtils]: Spent 467.00 ms on a formula simplification. DAG size of input: 161 DAG size of output: 122 [2019-12-07 10:54:58,143 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 93 [2019-12-07 10:54:59,184 WARN L192 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 101 [2019-12-07 10:54:59,824 WARN L192 SmtUtils]: Spent 414.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 103 [2019-12-07 10:55:00,243 WARN L192 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 105 [2019-12-07 10:55:00,757 WARN L192 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 103 [2019-12-07 10:55:01,514 WARN L192 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 119 [2019-12-07 10:55:02,222 WARN L192 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 123 [2019-12-07 10:55:02,788 WARN L192 SmtUtils]: Spent 386.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 110 [2019-12-07 10:55:03,390 WARN L192 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 119 [2019-12-07 10:55:04,009 WARN L192 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 133 [2019-12-07 10:55:04,988 WARN L192 SmtUtils]: Spent 720.00 ms on a formula simplification. DAG size of input: 239 DAG size of output: 146 [2019-12-07 10:55:06,891 WARN L192 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 244 DAG size of output: 160 [2019-12-07 10:55:07,661 WARN L192 SmtUtils]: Spent 417.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2019-12-07 10:55:08,648 WARN L192 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 140 [2019-12-07 10:55:09,093 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-12-07 10:55:09,322 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-12-07 10:55:09,572 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-12-07 10:55:09,821 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 59 [2019-12-07 10:55:10,121 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 67 [2019-12-07 10:55:10,436 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 70 [2019-12-07 10:55:10,776 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 77 [2019-12-07 10:55:11,096 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 75 [2019-12-07 10:55:11,459 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 77 [2019-12-07 10:55:11,829 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 83 [2019-12-07 10:55:12,174 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 82 [2019-12-07 10:55:12,659 WARN L192 SmtUtils]: Spent 272.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 84 [2019-12-07 10:55:13,131 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 86 [2019-12-07 10:55:13,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:55:13,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [12, 3, 3] total 73 [2019-12-07 10:55:13,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361762285] [2019-12-07 10:55:13,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-12-07 10:55:13,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:55:13,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-12-07 10:55:13,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=391, Invalid=4865, Unknown=0, NotChecked=0, Total=5256 [2019-12-07 10:55:13,134 INFO L87 Difference]: Start difference. First operand 164 states and 194 transitions. Second operand 60 states. [2019-12-07 10:55:13,629 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 109 [2019-12-07 10:55:13,953 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 113 [2019-12-07 10:55:14,511 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 93 [2019-12-07 10:55:14,806 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 95 [2019-12-07 10:55:15,197 WARN L192 SmtUtils]: Spent 325.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 95 [2019-12-07 10:55:15,485 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 97 [2019-12-07 10:55:15,875 WARN L192 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 86 [2019-12-07 10:55:16,274 WARN L192 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 89 [2019-12-07 10:55:16,743 WARN L192 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 93 [2019-12-07 10:55:16,963 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2019-12-07 10:55:17,230 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 91 [2019-12-07 10:55:17,462 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 95 [2019-12-07 10:55:17,730 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 97 [2019-12-07 10:55:18,044 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 100 [2019-12-07 10:55:18,416 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 102 [2019-12-07 10:55:18,687 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 98 [2019-12-07 10:55:18,982 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 100 [2019-12-07 10:55:19,308 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 93 [2019-12-07 10:55:19,924 WARN L192 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 96 [2019-12-07 10:55:20,297 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 100 [2019-12-07 10:55:20,616 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 107 [2019-12-07 10:55:21,347 WARN L192 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 102 [2019-12-07 10:55:21,718 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 109 [2019-12-07 10:55:22,100 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 99 [2019-12-07 10:55:22,512 WARN L192 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 107 [2019-12-07 10:55:22,980 WARN L192 SmtUtils]: Spent 363.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 101 [2019-12-07 10:55:23,591 WARN L192 SmtUtils]: Spent 383.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 107 [2019-12-07 10:55:27,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:55:27,314 INFO L93 Difference]: Finished difference Result 402 states and 480 transitions. [2019-12-07 10:55:27,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2019-12-07 10:55:27,314 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 76 [2019-12-07 10:55:27,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:55:27,316 INFO L225 Difference]: With dead ends: 402 [2019-12-07 10:55:27,316 INFO L226 Difference]: Without dead ends: 295 [2019-12-07 10:55:27,318 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 158 SyntacticMatches, 10 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3535 ImplicationChecksByTransitivity, 36.6s TimeCoverageRelationStatistics Valid=716, Invalid=9384, Unknown=0, NotChecked=0, Total=10100 [2019-12-07 10:55:27,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2019-12-07 10:55:27,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 174. [2019-12-07 10:55:27,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-12-07 10:55:27,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 206 transitions. [2019-12-07 10:55:27,330 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 206 transitions. Word has length 76 [2019-12-07 10:55:27,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:55:27,331 INFO L462 AbstractCegarLoop]: Abstraction has 174 states and 206 transitions. [2019-12-07 10:55:27,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-12-07 10:55:27,331 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 206 transitions. [2019-12-07 10:55:27,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-07 10:55:27,331 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:55:27,331 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 10:55:27,532 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:55:27,533 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 10:55:27,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:55:27,534 INFO L82 PathProgramCache]: Analyzing trace with hash 900670945, now seen corresponding path program 1 times [2019-12-07 10:55:27,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:55:27,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525301148] [2019-12-07 10:55:27,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:55:27,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:27,640 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 10:55:27,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525301148] [2019-12-07 10:55:27,640 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1306432411] [2019-12-07 10:55:27,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74e9a8a3-0e28-4934-ba47-1343a6e3177b/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 10:55:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:55:27,714 INFO L264 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 10:55:27,716 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:55:27,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 10:55:27,743 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:55:27,767 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 10:55:27,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1566804111] [2019-12-07 10:55:27,769 INFO L159 IcfgInterpreter]: Started Sifa with 77 locations of interest [2019-12-07 10:55:27,769 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:55:27,770 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 10:55:27,770 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 10:55:27,770 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 10:55:30,882 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 10:55:31,220 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 102 [2019-12-07 10:55:31,642 WARN L192 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 112 [2019-12-07 10:55:32,065 WARN L192 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 113 [2019-12-07 10:55:32,475 WARN L192 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 109 [2019-12-07 10:55:32,714 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 83 [2019-12-07 10:55:32,956 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2019-12-07 10:55:33,208 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 85 [2019-12-07 10:55:33,567 WARN L192 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 84 [2019-12-07 10:55:33,978 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 86 [2019-12-07 10:55:34,762 WARN L192 SmtUtils]: Spent 697.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 101 [2019-12-07 10:55:35,382 WARN L192 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2019-12-07 10:55:35,642 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2019-12-07 10:55:35,885 WARN L192 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 82 [2019-12-07 10:55:36,401 WARN L192 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 85 [2019-12-07 10:55:36,700 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 89 [2019-12-07 10:55:37,068 WARN L192 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 91 [2019-12-07 10:55:37,674 WARN L192 SmtUtils]: Spent 455.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 96 [2019-12-07 10:55:38,501 WARN L192 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 98 [2019-12-07 10:55:39,791 WARN L192 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 123 DAG size of output: 97 [2019-12-07 10:55:40,666 WARN L192 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 99 [2019-12-07 10:55:40,972 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 89 [2019-12-07 10:55:41,394 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 85 [2019-12-07 10:55:42,060 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 87 [2019-12-07 10:55:42,511 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 91 [2019-12-07 10:55:42,911 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 93 [2019-12-07 10:55:43,593 WARN L192 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 92 [2019-12-07 10:55:44,290 WARN L192 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 94 [2019-12-07 10:55:44,929 WARN L192 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 121 [2019-12-07 10:55:45,598 WARN L192 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 122 [2019-12-07 10:55:46,028 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 93 [2019-12-07 10:55:46,708 WARN L192 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 101 [2019-12-07 10:55:47,228 WARN L192 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 103 [2019-12-07 10:55:47,747 WARN L192 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 105 [2019-12-07 10:55:48,313 WARN L192 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 103 [2019-12-07 10:55:49,032 WARN L192 SmtUtils]: Spent 504.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 119 [2019-12-07 10:55:49,795 WARN L192 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 123 [2019-12-07 10:55:50,451 WARN L192 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 110 [2019-12-07 10:55:51,084 WARN L192 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 186 DAG size of output: 119 [2019-12-07 10:55:51,687 WARN L192 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 189 DAG size of output: 121 [2019-12-07 10:55:52,740 WARN L192 SmtUtils]: Spent 792.00 ms on a formula simplification. DAG size of input: 242 DAG size of output: 146 [2019-12-07 10:55:53,855 WARN L192 SmtUtils]: Spent 518.00 ms on a formula simplification. DAG size of input: 247 DAG size of output: 148 [2019-12-07 10:55:54,245 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification that was a NOOP. DAG size: 137 [2019-12-07 10:55:55,281 WARN L192 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 140 [2019-12-07 10:55:56,399 WARN L192 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2019-12-07 10:55:57,192 WARN L192 SmtUtils]: Spent 468.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 54 [2019-12-07 10:55:57,763 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 56 [2019-12-07 10:55:58,027 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2019-12-07 10:55:58,638 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 59 [2019-12-07 10:55:58,915 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 61 [2019-12-07 10:55:59,304 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 64 [2019-12-07 10:55:59,883 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 72 [2019-12-07 10:56:00,208 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 75 [2019-12-07 10:56:00,565 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 82 [2019-12-07 10:56:00,888 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 80 [2019-12-07 10:56:01,296 WARN L192 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 82 [2019-12-07 10:56:01,699 WARN L192 SmtUtils]: Spent 231.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 88 [2019-12-07 10:56:02,097 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 87 [2019-12-07 10:56:02,645 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 89 [2019-12-07 10:56:03,210 WARN L192 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 91 [2019-12-07 10:56:03,725 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 93 [2019-12-07 10:56:03,785 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 10:56:03,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:56:03,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 3, 3] total 15 [2019-12-07 10:56:03,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314572086] [2019-12-07 10:56:03,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 10:56:03,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:56:03,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 10:56:03,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=5582, Unknown=0, NotChecked=0, Total=6006 [2019-12-07 10:56:03,787 INFO L87 Difference]: Start difference. First operand 174 states and 206 transitions. Second operand 15 states. [2019-12-07 10:56:04,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:56:04,772 INFO L93 Difference]: Finished difference Result 557 states and 660 transitions. [2019-12-07 10:56:04,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-07 10:56:04,773 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 80 [2019-12-07 10:56:04,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:56:04,774 INFO L225 Difference]: With dead ends: 557 [2019-12-07 10:56:04,774 INFO L226 Difference]: Without dead ends: 391 [2019-12-07 10:56:04,777 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 284 GetRequests, 167 SyntacticMatches, 12 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4294 ImplicationChecksByTransitivity, 33.6s TimeCoverageRelationStatistics Valid=711, Invalid=10631, Unknown=0, NotChecked=0, Total=11342 [2019-12-07 10:56:04,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2019-12-07 10:56:04,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 267. [2019-12-07 10:56:04,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-12-07 10:56:04,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 303 transitions. [2019-12-07 10:56:04,804 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 303 transitions. Word has length 80 [2019-12-07 10:56:04,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:56:04,804 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 303 transitions. [2019-12-07 10:56:04,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 10:56:04,804 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 303 transitions. [2019-12-07 10:56:04,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-12-07 10:56:04,805 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:56:04,805 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 10:56:05,006 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:56:05,007 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 10:56:05,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:56:05,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1245620350, now seen corresponding path program 1 times [2019-12-07 10:56:05,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:56:05,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777369509] [2019-12-07 10:56:05,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:56:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:56:05,237 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 10:56:05,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777369509] [2019-12-07 10:56:05,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:56:05,237 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-07 10:56:05,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866093305] [2019-12-07 10:56:05,237 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 10:56:05,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:56:05,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 10:56:05,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2019-12-07 10:56:05,238 INFO L87 Difference]: Start difference. First operand 267 states and 303 transitions. Second operand 14 states. [2019-12-07 10:56:05,847 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 19 [2019-12-07 10:56:06,122 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 22 [2019-12-07 10:56:07,045 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 17 [2019-12-07 10:56:07,338 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 20 [2019-12-07 10:56:08,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:56:08,680 INFO L93 Difference]: Finished difference Result 543 states and 637 transitions. [2019-12-07 10:56:08,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 10:56:08,682 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 149 [2019-12-07 10:56:08,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:56:08,687 INFO L225 Difference]: With dead ends: 543 [2019-12-07 10:56:08,688 INFO L226 Difference]: Without dead ends: 426 [2019-12-07 10:56:08,689 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=177, Invalid=693, Unknown=0, NotChecked=0, Total=870 [2019-12-07 10:56:08,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-12-07 10:56:08,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 291. [2019-12-07 10:56:08,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-12-07 10:56:08,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 331 transitions. [2019-12-07 10:56:08,726 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 331 transitions. Word has length 149 [2019-12-07 10:56:08,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:56:08,726 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 331 transitions. [2019-12-07 10:56:08,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 10:56:08,726 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 331 transitions. [2019-12-07 10:56:08,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-12-07 10:56:08,727 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:56:08,727 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 10:56:08,727 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 10:56:08,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:56:08,727 INFO L82 PathProgramCache]: Analyzing trace with hash -935324301, now seen corresponding path program 1 times [2019-12-07 10:56:08,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:56:08,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668998544] [2019-12-07 10:56:08,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:56:08,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:56:08,843 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 10:56:08,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668998544] [2019-12-07 10:56:08,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:56:08,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 10:56:08,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889164855] [2019-12-07 10:56:08,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 10:56:08,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:56:08,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 10:56:08,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 10:56:08,845 INFO L87 Difference]: Start difference. First operand 291 states and 331 transitions. Second operand 10 states. [2019-12-07 10:56:09,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:56:09,693 INFO L93 Difference]: Finished difference Result 752 states and 889 transitions. [2019-12-07 10:56:09,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-07 10:56:09,693 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 149 [2019-12-07 10:56:09,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:56:09,695 INFO L225 Difference]: With dead ends: 752 [2019-12-07 10:56:09,695 INFO L226 Difference]: Without dead ends: 611 [2019-12-07 10:56:09,696 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 519 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=413, Invalid=1393, Unknown=0, NotChecked=0, Total=1806 [2019-12-07 10:56:09,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 611 states. [2019-12-07 10:56:09,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 611 to 340. [2019-12-07 10:56:09,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 340 states. [2019-12-07 10:56:09,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 393 transitions. [2019-12-07 10:56:09,718 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 393 transitions. Word has length 149 [2019-12-07 10:56:09,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:56:09,719 INFO L462 AbstractCegarLoop]: Abstraction has 340 states and 393 transitions. [2019-12-07 10:56:09,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 10:56:09,719 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 393 transitions. [2019-12-07 10:56:09,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-12-07 10:56:09,720 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:56:09,720 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, 1] [2019-12-07 10:56:09,720 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 10:56:09,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:56:09,720 INFO L82 PathProgramCache]: Analyzing trace with hash 2010281936, now seen corresponding path program 1 times [2019-12-07 10:56:09,720 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:56:09,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146666898] [2019-12-07 10:56:09,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:56:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:56:09,771 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 10:56:09,771 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146666898] [2019-12-07 10:56:09,771 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:56:09,771 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 10:56:09,772 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788689441] [2019-12-07 10:56:09,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 10:56:09,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:56:09,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 10:56:09,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 10:56:09,772 INFO L87 Difference]: Start difference. First operand 340 states and 393 transitions. Second operand 4 states. [2019-12-07 10:56:09,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:56:09,879 INFO L93 Difference]: Finished difference Result 608 states and 720 transitions. [2019-12-07 10:56:09,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 10:56:09,879 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 159 [2019-12-07 10:56:09,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:56:09,881 INFO L225 Difference]: With dead ends: 608 [2019-12-07 10:56:09,881 INFO L226 Difference]: Without dead ends: 418 [2019-12-07 10:56:09,882 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 10:56:09,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2019-12-07 10:56:09,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 291. [2019-12-07 10:56:09,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-12-07 10:56:09,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 327 transitions. [2019-12-07 10:56:09,907 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 327 transitions. Word has length 159 [2019-12-07 10:56:09,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:56:09,907 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 327 transitions. [2019-12-07 10:56:09,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 10:56:09,907 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 327 transitions. [2019-12-07 10:56:09,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2019-12-07 10:56:09,908 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:56:09,909 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] [2019-12-07 10:56:09,909 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 10:56:09,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:56:09,909 INFO L82 PathProgramCache]: Analyzing trace with hash 679419950, now seen corresponding path program 1 times [2019-12-07 10:56:09,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:56:09,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37281411] [2019-12-07 10:56:09,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:56:09,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:56:10,005 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 10:56:10,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37281411] [2019-12-07 10:56:10,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 10:56:10,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-07 10:56:10,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894379899] [2019-12-07 10:56:10,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 10:56:10,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:56:10,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 10:56:10,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 10:56:10,007 INFO L87 Difference]: Start difference. First operand 291 states and 327 transitions. Second operand 9 states. [2019-12-07 10:56:10,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:56:10,435 INFO L93 Difference]: Finished difference Result 610 states and 711 transitions. [2019-12-07 10:56:10,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-07 10:56:10,435 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 172 [2019-12-07 10:56:10,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:56:10,438 INFO L225 Difference]: With dead ends: 610 [2019-12-07 10:56:10,438 INFO L226 Difference]: Without dead ends: 473 [2019-12-07 10:56:10,438 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 10:56:10,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2019-12-07 10:56:10,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 299. [2019-12-07 10:56:10,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2019-12-07 10:56:10,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 337 transitions. [2019-12-07 10:56:10,471 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 337 transitions. Word has length 172 [2019-12-07 10:56:10,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:56:10,472 INFO L462 AbstractCegarLoop]: Abstraction has 299 states and 337 transitions. [2019-12-07 10:56:10,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 10:56:10,472 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 337 transitions. [2019-12-07 10:56:10,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-12-07 10:56:10,473 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:56:10,474 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] [2019-12-07 10:56:10,474 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 10:56:10,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:56:10,474 INFO L82 PathProgramCache]: Analyzing trace with hash 71097959, now seen corresponding path program 1 times [2019-12-07 10:56:10,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:56:10,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820744624] [2019-12-07 10:56:10,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:56:10,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:56:11,504 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 10:56:11,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820744624] [2019-12-07 10:56:11,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331806933] [2019-12-07 10:56:11,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74e9a8a3-0e28-4934-ba47-1343a6e3177b/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 10:56:11,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:56:11,605 INFO L264 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 30 conjunts are in the unsatisfiable core [2019-12-07 10:56:11,611 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:56:11,822 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 10:56:11,823 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:56:12,130 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 10:56:12,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1722692171] [2019-12-07 10:56:12,132 INFO L159 IcfgInterpreter]: Started Sifa with 83 locations of interest [2019-12-07 10:56:12,132 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:56:12,132 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 10:56:12,133 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 10:56:12,133 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 10:56:16,464 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 10:56:16,714 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 72 [2019-12-07 10:56:17,231 WARN L192 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 112 [2019-12-07 10:56:17,817 WARN L192 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 113 [2019-12-07 10:56:18,369 WARN L192 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 109 [2019-12-07 10:56:18,692 WARN L192 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 83 [2019-12-07 10:56:19,014 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2019-12-07 10:56:19,342 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 85 [2019-12-07 10:56:19,785 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 84 [2019-12-07 10:56:20,340 WARN L192 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 86 [2019-12-07 10:56:21,017 WARN L192 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 101 [2019-12-07 10:56:21,741 WARN L192 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2019-12-07 10:56:22,045 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2019-12-07 10:56:22,343 WARN L192 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 82 [2019-12-07 10:56:23,031 WARN L192 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 85 [2019-12-07 10:56:23,551 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 89 [2019-12-07 10:56:23,983 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 91 [2019-12-07 10:56:24,665 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 96 [2019-12-07 10:56:25,118 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 98 [2019-12-07 10:56:26,054 WARN L192 SmtUtils]: Spent 751.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 97 [2019-12-07 10:56:27,012 WARN L192 SmtUtils]: Spent 687.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 99 [2019-12-07 10:56:27,435 WARN L192 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 89 [2019-12-07 10:56:28,068 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 85 [2019-12-07 10:56:28,894 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 87 [2019-12-07 10:56:29,402 WARN L192 SmtUtils]: Spent 288.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 91 [2019-12-07 10:56:30,301 WARN L192 SmtUtils]: Spent 553.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 93 [2019-12-07 10:56:32,467 WARN L192 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 92 [2019-12-07 10:56:32,999 WARN L192 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 94 [2019-12-07 10:56:33,741 WARN L192 SmtUtils]: Spent 461.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 121 [2019-12-07 10:56:34,596 WARN L192 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 122 [2019-12-07 10:56:34,980 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 93 [2019-12-07 10:56:35,779 WARN L192 SmtUtils]: Spent 266.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 101 [2019-12-07 10:56:36,248 WARN L192 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 103 [2019-12-07 10:56:36,720 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 105 [2019-12-07 10:56:37,315 WARN L192 SmtUtils]: Spent 360.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 103 [2019-12-07 10:56:39,834 WARN L192 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 119 [2019-12-07 10:56:40,648 WARN L192 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 123 [2019-12-07 10:56:41,296 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 59 [2019-12-07 10:56:42,794 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-12-07 10:56:43,543 WARN L192 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-12-07 10:56:44,428 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 41 [2019-12-07 10:56:46,173 WARN L192 SmtUtils]: Spent 427.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 82 [2019-12-07 10:56:47,090 WARN L192 SmtUtils]: Spent 512.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 87 [2019-12-07 10:56:48,060 WARN L192 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 73 [2019-12-07 10:56:48,612 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 25 [2019-12-07 10:56:49,741 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 38 [2019-12-07 10:56:50,419 WARN L192 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 41 [2019-12-07 10:56:51,674 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 10:56:51,674 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 10:56:51,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 10, 12] total 35 [2019-12-07 10:56:51,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534000340] [2019-12-07 10:56:51,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-07 10:56:51,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 10:56:51,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 10:56:51,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=638, Invalid=10492, Unknown=0, NotChecked=0, Total=11130 [2019-12-07 10:56:51,678 INFO L87 Difference]: Start difference. First operand 299 states and 337 transitions. Second operand 36 states. [2019-12-07 10:56:53,991 WARN L192 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 47 [2019-12-07 10:56:54,659 WARN L192 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-12-07 10:56:56,019 WARN L192 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-12-07 10:56:57,544 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 74 [2019-12-07 10:56:58,318 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2019-12-07 10:56:58,596 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 58 [2019-12-07 10:56:58,974 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-12-07 10:56:59,730 WARN L192 SmtUtils]: Spent 538.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 77 [2019-12-07 10:57:00,403 WARN L192 SmtUtils]: Spent 428.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-12-07 10:57:01,150 WARN L192 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-12-07 10:57:01,531 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-12-07 10:57:02,073 WARN L192 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-12-07 10:57:02,513 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-12-07 10:57:03,279 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 65 [2019-12-07 10:57:04,102 WARN L192 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-12-07 10:57:04,473 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-12-07 10:57:06,316 WARN L192 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2019-12-07 10:57:06,657 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 54 [2019-12-07 10:57:07,085 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-12-07 10:57:08,573 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-12-07 10:57:09,290 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2019-12-07 10:57:10,047 WARN L192 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 58 [2019-12-07 10:57:11,064 WARN L192 SmtUtils]: Spent 377.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 62 [2019-12-07 10:57:11,701 WARN L192 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2019-12-07 10:57:11,964 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-12-07 10:57:12,242 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2019-12-07 10:57:12,458 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 71 [2019-12-07 10:57:14,086 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 69 [2019-12-07 10:57:14,703 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-12-07 10:57:15,321 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 72 [2019-12-07 10:57:16,103 WARN L192 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-12-07 10:57:16,533 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-12-07 10:57:17,168 WARN L192 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2019-12-07 10:57:17,775 WARN L192 SmtUtils]: Spent 422.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-12-07 10:57:18,382 WARN L192 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 62 [2019-12-07 10:57:18,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 10:57:18,384 INFO L93 Difference]: Finished difference Result 856 states and 990 transitions. [2019-12-07 10:57:18,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-12-07 10:57:18,384 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 175 [2019-12-07 10:57:18,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 10:57:18,386 INFO L225 Difference]: With dead ends: 856 [2019-12-07 10:57:18,386 INFO L226 Difference]: Without dead ends: 703 [2019-12-07 10:57:18,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 681 GetRequests, 420 SyntacticMatches, 20 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21930 ImplicationChecksByTransitivity, 59.1s TimeCoverageRelationStatistics Valid=3723, Invalid=55083, Unknown=0, NotChecked=0, Total=58806 [2019-12-07 10:57:18,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 703 states. [2019-12-07 10:57:18,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 703 to 288. [2019-12-07 10:57:18,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-12-07 10:57:18,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 321 transitions. [2019-12-07 10:57:18,418 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 321 transitions. Word has length 175 [2019-12-07 10:57:18,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 10:57:18,418 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 321 transitions. [2019-12-07 10:57:18,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-07 10:57:18,418 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 321 transitions. [2019-12-07 10:57:18,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-12-07 10:57:18,419 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 10:57:18,420 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] [2019-12-07 10:57:18,620 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 10:57:18,621 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 10:57:18,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 10:57:18,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1422195730, now seen corresponding path program 1 times [2019-12-07 10:57:18,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 10:57:18,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532265520] [2019-12-07 10:57:18,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 10:57:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:57:19,275 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 10:57:19,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532265520] [2019-12-07 10:57:19,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822373361] [2019-12-07 10:57:19,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74e9a8a3-0e28-4934-ba47-1343a6e3177b/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 10:57:19,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 10:57:19,388 INFO L264 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-07 10:57:19,394 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 10:57:19,887 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 10:57:19,888 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 10:57:20,412 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 10:57:20,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1385324871] [2019-12-07 10:57:20,414 INFO L159 IcfgInterpreter]: Started Sifa with 87 locations of interest [2019-12-07 10:57:20,414 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 10:57:20,415 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 10:57:20,415 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 10:57:20,415 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 10:57:22,220 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 21952 conjuctions. This might take some time... [2019-12-07 10:59:09,819 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 21952 conjuctions. This might take some time... [2019-12-07 11:01:01,079 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 11:01:01,390 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 77 [2019-12-07 11:01:01,934 WARN L192 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 112 [2019-12-07 11:01:02,505 WARN L192 SmtUtils]: Spent 361.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 113 [2019-12-07 11:01:03,021 WARN L192 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 109 [2019-12-07 11:01:03,527 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 83 [2019-12-07 11:01:04,040 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 81 [2019-12-07 11:01:04,585 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 85 [2019-12-07 11:01:05,045 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 84 [2019-12-07 11:01:05,873 WARN L192 SmtUtils]: Spent 551.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 86 [2019-12-07 11:01:07,778 WARN L192 SmtUtils]: Spent 1.59 s on a formula simplification. DAG size of input: 119 DAG size of output: 101 [2019-12-07 11:01:08,579 WARN L192 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2019-12-07 11:01:08,875 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2019-12-07 11:01:09,237 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 82 [2019-12-07 11:01:09,980 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 85 [2019-12-07 11:01:10,450 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 89 [2019-12-07 11:01:10,833 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 91 [2019-12-07 11:01:11,962 WARN L192 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 96 [2019-12-07 11:01:12,580 WARN L192 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 98 [2019-12-07 11:01:13,446 WARN L192 SmtUtils]: Spent 597.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 97 [2019-12-07 11:01:14,212 WARN L192 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 99 [2019-12-07 11:01:14,819 WARN L192 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 89 [2019-12-07 11:01:15,352 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 85 [2019-12-07 11:01:16,598 WARN L192 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 87 [2019-12-07 11:01:17,213 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 91 [2019-12-07 11:01:17,644 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 93 [2019-12-07 11:01:19,057 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 92 [2019-12-07 11:01:19,572 WARN L192 SmtUtils]: Spent 285.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 94 [2019-12-07 11:01:20,955 WARN L192 SmtUtils]: Spent 1.03 s on a formula simplification. DAG size of input: 165 DAG size of output: 125 [2019-12-07 11:01:22,262 WARN L192 SmtUtils]: Spent 874.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 127 [2019-12-07 11:01:22,753 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 91 [2019-12-07 11:01:24,125 WARN L192 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 99 [2019-12-07 11:01:24,781 WARN L192 SmtUtils]: Spent 355.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 103 [2019-12-07 11:01:25,269 WARN L192 SmtUtils]: Spent 296.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 105 [2019-12-07 11:01:25,776 WARN L192 SmtUtils]: Spent 280.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 103 [2019-12-07 11:01:27,473 WARN L192 SmtUtils]: Spent 450.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 124 [2019-12-07 11:01:28,314 WARN L192 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 128 [2019-12-07 11:01:29,104 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 59 [2019-12-07 11:01:31,199 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 24 [2019-12-07 11:01:32,886 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-12-07 11:01:33,160 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 43 [2019-12-07 11:01:35,372 WARN L192 SmtUtils]: Spent 381.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2019-12-07 11:01:35,975 WARN L192 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 89 [2019-12-07 11:01:36,672 WARN L192 SmtUtils]: Spent 316.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 77 [2019-12-07 11:01:39,043 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 58 [2019-12-07 11:01:39,379 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 11:01:39,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:01:39,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 15] total 49 [2019-12-07 11:01:39,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068898009] [2019-12-07 11:01:39,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 49 states [2019-12-07 11:01:39,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:01:39,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2019-12-07 11:01:39,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=13975, Unknown=0, NotChecked=0, Total=14762 [2019-12-07 11:01:39,381 INFO L87 Difference]: Start difference. First operand 288 states and 321 transitions. Second operand 49 states. [2019-12-07 11:01:43,383 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-12-07 11:01:43,871 WARN L192 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-12-07 11:01:45,702 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-12-07 11:01:46,088 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-12-07 11:01:46,959 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-12-07 11:01:49,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:49,310 INFO L93 Difference]: Finished difference Result 648 states and 742 transitions. [2019-12-07 11:01:49,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2019-12-07 11:01:49,311 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 179 [2019-12-07 11:01:49,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:49,312 INFO L225 Difference]: With dead ends: 648 [2019-12-07 11:01:49,312 INFO L226 Difference]: Without dead ends: 506 [2019-12-07 11:01:49,314 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 627 GetRequests, 415 SyntacticMatches, 21 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13221 ImplicationChecksByTransitivity, 46.0s TimeCoverageRelationStatistics Valid=2139, Invalid=34917, Unknown=0, NotChecked=0, Total=37056 [2019-12-07 11:01:49,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 506 states. [2019-12-07 11:01:49,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 506 to 288. [2019-12-07 11:01:49,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-12-07 11:01:49,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 319 transitions. [2019-12-07 11:01:49,341 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 319 transitions. Word has length 179 [2019-12-07 11:01:49,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:49,342 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 319 transitions. [2019-12-07 11:01:49,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 49 states. [2019-12-07 11:01:49,342 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 319 transitions. [2019-12-07 11:01:49,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-12-07 11:01:49,342 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:49,343 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, 1] [2019-12-07 11:01:49,543 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:01:49,544 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 11:01:49,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:49,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1728463614, now seen corresponding path program 1 times [2019-12-07 11:01:49,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:01:49,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419050427] [2019-12-07 11:01:49,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:49,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:49,712 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 11:01:49,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419050427] [2019-12-07 11:01:49,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:49,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-07 11:01:49,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140216793] [2019-12-07 11:01:49,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 11:01:49,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:01:49,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 11:01:49,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:01:49,714 INFO L87 Difference]: Start difference. First operand 288 states and 319 transitions. Second operand 10 states. [2019-12-07 11:01:50,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:50,152 INFO L93 Difference]: Finished difference Result 560 states and 637 transitions. [2019-12-07 11:01:50,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-07 11:01:50,152 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 187 [2019-12-07 11:01:50,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:50,154 INFO L225 Difference]: With dead ends: 560 [2019-12-07 11:01:50,154 INFO L226 Difference]: Without dead ends: 426 [2019-12-07 11:01:50,154 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 11:01:50,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2019-12-07 11:01:50,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 289. [2019-12-07 11:01:50,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-12-07 11:01:50,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 320 transitions. [2019-12-07 11:01:50,183 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 320 transitions. Word has length 187 [2019-12-07 11:01:50,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:50,183 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 320 transitions. [2019-12-07 11:01:50,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 11:01:50,183 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 320 transitions. [2019-12-07 11:01:50,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-12-07 11:01:50,184 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:50,184 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, 1] [2019-12-07 11:01:50,184 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 11:01:50,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:50,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1418167565, now seen corresponding path program 1 times [2019-12-07 11:01:50,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:01:50,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702080175] [2019-12-07 11:01:50,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:50,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:50,266 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 11:01:50,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702080175] [2019-12-07 11:01:50,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:50,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-07 11:01:50,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2073578478] [2019-12-07 11:01:50,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 11:01:50,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:01:50,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 11:01:50,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:01:50,267 INFO L87 Difference]: Start difference. First operand 289 states and 320 transitions. Second operand 8 states. [2019-12-07 11:01:50,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:50,434 INFO L93 Difference]: Finished difference Result 513 states and 580 transitions. [2019-12-07 11:01:50,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:01:50,434 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 187 [2019-12-07 11:01:50,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:50,435 INFO L225 Difference]: With dead ends: 513 [2019-12-07 11:01:50,436 INFO L226 Difference]: Without dead ends: 378 [2019-12-07 11:01:50,436 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 11:01:50,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2019-12-07 11:01:50,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 329. [2019-12-07 11:01:50,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2019-12-07 11:01:50,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 369 transitions. [2019-12-07 11:01:50,469 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 369 transitions. Word has length 187 [2019-12-07 11:01:50,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:50,469 INFO L462 AbstractCegarLoop]: Abstraction has 329 states and 369 transitions. [2019-12-07 11:01:50,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 11:01:50,469 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 369 transitions. [2019-12-07 11:01:50,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-12-07 11:01:50,470 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:50,470 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, 1] [2019-12-07 11:01:50,470 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 11:01:50,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:50,470 INFO L82 PathProgramCache]: Analyzing trace with hash -944174260, now seen corresponding path program 1 times [2019-12-07 11:01:50,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:01:50,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430115173] [2019-12-07 11:01:50,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:50,577 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 11:01:50,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430115173] [2019-12-07 11:01:50,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:01:50,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-07 11:01:50,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536280597] [2019-12-07 11:01:50,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 11:01:50,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:01:50,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 11:01:50,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:01:50,578 INFO L87 Difference]: Start difference. First operand 329 states and 369 transitions. Second operand 11 states. [2019-12-07 11:01:50,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:01:50,896 INFO L93 Difference]: Finished difference Result 555 states and 631 transitions. [2019-12-07 11:01:50,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-07 11:01:50,896 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 188 [2019-12-07 11:01:50,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:01:50,898 INFO L225 Difference]: With dead ends: 555 [2019-12-07 11:01:50,898 INFO L226 Difference]: Without dead ends: 380 [2019-12-07 11:01:50,898 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 11:01:50,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-12-07 11:01:50,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 326. [2019-12-07 11:01:50,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-12-07 11:01:50,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 364 transitions. [2019-12-07 11:01:50,933 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 364 transitions. Word has length 188 [2019-12-07 11:01:50,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:01:50,934 INFO L462 AbstractCegarLoop]: Abstraction has 326 states and 364 transitions. [2019-12-07 11:01:50,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 11:01:50,934 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 364 transitions. [2019-12-07 11:01:50,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-12-07 11:01:50,935 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:01:50,935 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] [2019-12-07 11:01:50,935 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 11:01:50,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:01:50,935 INFO L82 PathProgramCache]: Analyzing trace with hash 926403638, now seen corresponding path program 1 times [2019-12-07 11:01:50,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:01:50,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362470099] [2019-12-07 11:01:50,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:01:50,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:51,141 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 11:01:51,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362470099] [2019-12-07 11:01:51,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1669524513] [2019-12-07 11:01:51,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_74e9a8a3-0e28-4934-ba47-1343a6e3177b/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 11:01:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:01:51,249 INFO L264 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 42 conjunts are in the unsatisfiable core [2019-12-07 11:01:51,252 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:01:51,528 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 11:01:51,528 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:01:51,893 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 11:01:51,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1894742006] [2019-12-07 11:01:51,895 INFO L159 IcfgInterpreter]: Started Sifa with 97 locations of interest [2019-12-07 11:01:51,895 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 11:01:51,896 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 11:01:51,896 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 11:01:51,896 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 11:01:53,766 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 10976 conjuctions. This might take some time... [2019-12-07 11:02:22,224 WARN L177 XnfTransformerHelper]: Simplifying disjunction of 10976 conjuctions. This might take some time... [2019-12-07 11:02:52,164 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 11:02:52,397 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 67 [2019-12-07 11:02:53,121 WARN L192 SmtUtils]: Spent 593.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 133 [2019-12-07 11:02:53,865 WARN L192 SmtUtils]: Spent 601.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 134 [2019-12-07 11:02:54,419 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 82 [2019-12-07 11:02:54,716 WARN L192 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 87 [2019-12-07 11:02:55,030 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 89 [2019-12-07 11:02:55,509 WARN L192 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 103 [2019-12-07 11:02:56,130 WARN L192 SmtUtils]: Spent 411.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 105 [2019-12-07 11:02:57,124 WARN L192 SmtUtils]: Spent 819.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 101 [2019-12-07 11:02:58,078 WARN L192 SmtUtils]: Spent 719.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 103 [2019-12-07 11:02:58,366 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 84 [2019-12-07 11:02:58,678 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 82 [2019-12-07 11:02:59,356 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 85 [2019-12-07 11:02:59,736 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 89 [2019-12-07 11:03:00,277 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 91 [2019-12-07 11:03:01,148 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 96 [2019-12-07 11:03:01,601 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 98 [2019-12-07 11:03:02,284 WARN L192 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 97 [2019-12-07 11:03:02,916 WARN L192 SmtUtils]: Spent 485.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 99 [2019-12-07 11:03:03,309 WARN L192 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 87 [2019-12-07 11:03:03,728 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 85 [2019-12-07 11:03:04,545 WARN L192 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 88 [2019-12-07 11:03:04,963 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 92 [2019-12-07 11:03:05,527 WARN L192 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 94 [2019-12-07 11:03:07,628 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 92 [2019-12-07 11:03:08,141 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 94 [2019-12-07 11:03:08,919 WARN L192 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 111 [2019-12-07 11:03:09,617 WARN L192 SmtUtils]: Spent 498.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 112 [2019-12-07 11:03:10,406 WARN L192 SmtUtils]: Spent 571.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 92 [2019-12-07 11:03:11,344 WARN L192 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 100 [2019-12-07 11:03:11,809 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 102 [2019-12-07 11:03:12,534 WARN L192 SmtUtils]: Spent 412.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 104 [2019-12-07 11:03:13,080 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 102 [2019-12-07 11:03:15,066 WARN L192 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 106 [2019-12-07 11:03:15,687 WARN L192 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 110 [2019-12-07 11:03:16,346 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2019-12-07 11:03:18,452 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 51 [2019-12-07 11:03:18,932 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 54 [2019-12-07 11:03:19,200 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 56 [2019-12-07 11:03:19,461 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 56 [2019-12-07 11:03:19,891 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 59 [2019-12-07 11:03:20,183 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 61 [2019-12-07 11:03:20,460 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 62 [2019-12-07 11:03:21,148 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 65 [2019-12-07 11:03:21,488 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 67 [2019-12-07 11:03:23,028 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 44 [2019-12-07 11:03:23,474 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 46 [2019-12-07 11:03:24,386 WARN L192 SmtUtils]: Spent 501.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-12-07 11:03:24,987 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 77 [2019-12-07 11:03:25,363 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 66 [2019-12-07 11:03:28,948 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 59 [2019-12-07 11:03:29,409 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 61 [2019-12-07 11:03:29,410 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 11:03:29,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 11:03:29,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 20, 16] total 36 [2019-12-07 11:03:29,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978045907] [2019-12-07 11:03:29,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-12-07 11:03:29,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 11:03:29,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-12-07 11:03:29,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=724, Invalid=12158, Unknown=0, NotChecked=0, Total=12882 [2019-12-07 11:03:29,412 INFO L87 Difference]: Start difference. First operand 326 states and 364 transitions. Second operand 36 states. [2019-12-07 11:03:31,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:03:31,764 INFO L93 Difference]: Finished difference Result 647 states and 736 transitions. [2019-12-07 11:03:31,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-07 11:03:31,765 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 189 [2019-12-07 11:03:31,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:03:31,766 INFO L225 Difference]: With dead ends: 647 [2019-12-07 11:03:31,766 INFO L226 Difference]: Without dead ends: 467 [2019-12-07 11:03:31,767 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 601 GetRequests, 438 SyntacticMatches, 29 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8757 ImplicationChecksByTransitivity, 39.3s TimeCoverageRelationStatistics Valid=1031, Invalid=17329, Unknown=0, NotChecked=0, Total=18360 [2019-12-07 11:03:31,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2019-12-07 11:03:31,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 326. [2019-12-07 11:03:31,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2019-12-07 11:03:31,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 363 transitions. [2019-12-07 11:03:31,802 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 363 transitions. Word has length 189 [2019-12-07 11:03:31,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:03:31,802 INFO L462 AbstractCegarLoop]: Abstraction has 326 states and 363 transitions. [2019-12-07 11:03:31,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-12-07 11:03:31,802 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 363 transitions. [2019-12-07 11:03:31,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2019-12-07 11:03:31,803 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:03:31,803 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, 1] [2019-12-07 11:03:32,003 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 11:03:32,004 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 11:03:32,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:03:32,005 INFO L82 PathProgramCache]: Analyzing trace with hash 48041675, now seen corresponding path program 1 times [2019-12-07 11:03:32,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 11:03:32,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683817943] [2019-12-07 11:03:32,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:03:32,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:03:32,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:03:32,303 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 11:03:32,303 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:03:32,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:03:32 BoogieIcfgContainer [2019-12-07 11:03:32,435 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:03:32,435 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:03:32,435 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:03:32,435 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:03:32,436 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 10:54:39" (3/4) ... [2019-12-07 11:03:32,437 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 11:03:32,570 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_74e9a8a3-0e28-4934-ba47-1343a6e3177b/bin/utaipan/witness.graphml [2019-12-07 11:03:32,570 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:03:32,571 INFO L168 Benchmark]: Toolchain (without parser) took 535081.10 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 938.1 MB in the beginning and 952.3 MB in the end (delta: -14.2 MB). Peak memory consumption was 465.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:03:32,571 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:03:32,571 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:03:32,571 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:03:32,571 INFO L168 Benchmark]: Boogie Preprocessor took 50.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:03:32,571 INFO L168 Benchmark]: RCFGBuilder took 1602.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 63.5 MB). Peak memory consumption was 246.6 MB. Max. memory is 11.5 GB. [2019-12-07 11:03:32,572 INFO L168 Benchmark]: TraceAbstraction took 532974.95 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 36.7 MB). Free memory was 1.0 GB in the beginning and 659.1 MB in the end (delta: 371.4 MB). Peak memory consumption was 408.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:03:32,572 INFO L168 Benchmark]: Witness Printer took 134.72 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -524.3 kB). Free memory was 659.1 MB in the beginning and 952.3 MB in the end (delta: -293.1 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. [2019-12-07 11:03:32,573 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 955.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 263.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -173.4 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 50.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1602.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 63.5 MB). Peak memory consumption was 246.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 532974.95 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 36.7 MB). Free memory was 1.0 GB in the beginning and 659.1 MB in the end (delta: 371.4 MB). Peak memory consumption was 408.1 MB. Max. memory is 11.5 GB. * Witness Printer took 134.72 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: -524.3 kB). Free memory was 659.1 MB in the beginning and 952.3 MB in the end (delta: -293.1 MB). Peak memory consumption was 27.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 581]: 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=-1, 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=-1, 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=-1, 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=-1, 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=-1, 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=-1, 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=-1, 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=-1, 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=-1, 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=-1, 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=-1, 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=-1, 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=-1, 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=-1, 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=-1, 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=-1, 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=-1, 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=-1, 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=5, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-1, 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=5, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-1, 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=5, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-1, 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=5, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-1, 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=5, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-1, 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=5, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-1, 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=5, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-1, 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=5, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-1, 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=5, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-1, 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=5, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-1, 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=5, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-1, 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=5, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-1, 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=5, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-1, 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=5, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-1, 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=5, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-1, 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=5, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-1, 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=5, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-1, 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=5, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-1, 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=5, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-1, 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=5, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-1, 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=5, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-1, 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=5, gate2Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, votedValue_History_2=-2] [L554] COND TRUE i2 < 10 [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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=5, 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=-1, 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=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=5, 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=-1, 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=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=5, 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=-1, 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=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=5, 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=-1] [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=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=5, 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=-1] [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=2, 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=5, 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=-1] [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=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=5, 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=-1] [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=2, 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=5, 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=-1] [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=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=5, 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=-1] [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=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=5, 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=-1] [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=2, 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=5, 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=-1] [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=2, 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=5, 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=-1] [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=2, 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=5, 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=-1] [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=2, 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=5, 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=-1] [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=2, 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=5, 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=-1] [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=2, 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=5, 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=-1] [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=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=5, 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=-1] [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=2, 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=5, 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=-1] [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=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=5, 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=-1] [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=2, 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=5, 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=-1] [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=2, 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=5, 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=-1] [L566] c1 = check() [L579] 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=2, 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=5, 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=-1] [L568] i2 ++ 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=0, gate1Failed_History_2=13, gate2Failed=255, gate2Failed_History_0=255, gate2Failed_History_1=0, gate2Failed_History_2=5, 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=-1] [L554] COND TRUE i2 < 10 [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=2, 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=5, 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=-1] [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=2, 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=5, 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=-1] [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=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=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-1] [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=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=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-1] [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=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=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-1] [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=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=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-1] [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=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=2, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-1] [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=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=2, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=-1] [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=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=2, 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=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=2, 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=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=2, 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=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=2, 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=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=2, 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=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=2, 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=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=2, 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=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=2, 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=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=2, 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=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=2, 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=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=2, 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=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=2, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L566] c1 = check() [L579] 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=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=2, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L581] __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=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=2, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 334 locations, 37 error locations. Result: UNSAFE, OverallTime: 532.7s, OverallIterations: 33, TraceHistogramMax: 3, AutomataDifference: 60.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8483 SDtfs, 14081 SDslu, 23844 SDs, 0 SdLazy, 14548 SolverSat, 1353 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2712 GetRequests, 1670 SyntacticMatches, 94 SemanticMatches, 948 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52581 ImplicationChecksByTransitivity, 217.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=340occurred 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.4s AutomataMinimizationTime, 32 MinimizatonAttempts, 3989 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 3513 NumberOfCodeBlocks, 3513 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 3973 ConstructedInterpolants, 15 QuantifiedInterpolants, 2708513 SizeOfPredicates, 89 NumberOfNonLiveVariables, 3142 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]: 3987, 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]: 177, 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]: 144, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 69, FLUID_QUERY_TIME[ms]: 7, FLUID_QUERIES: 253, FLUID_YES_ANSWERS: 4, DOMAIN_JOIN_APPLICATIONS: 17, DOMAIN_JOIN_TIME[ms]: 1314, DOMAIN_ALPHA_APPLICATIONS: 4, DOMAIN_ALPHA_TIME[ms]: 1748, DOMAIN_WIDEN_APPLICATIONS: 5, DOMAIN_WIDEN_TIME[ms]: 330, DOMAIN_ISSUBSETEQ_APPLICATIONS: 9, DOMAIN_ISSUBSETEQ_TIME[ms]: 23, DOMAIN_ISBOTTOM_APPLICATIONS: 73, DOMAIN_ISBOTTOM_TIME[ms]: 163, LOOP_SUMMARIZER_APPLICATIONS: 4, LOOP_SUMMARIZER_CACHE_MISSES: 4, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 398, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 397, 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]: 176, DAG_COMPRESSION_PROCESSED_NODES: 12674, DAG_COMPRESSION_RETAINED_NODES: 206, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...