./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_68706f7d-f345-4e4b-9847-f04102398d2a/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_68706f7d-f345-4e4b-9847-f04102398d2a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_68706f7d-f345-4e4b-9847-f04102398d2a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_68706f7d-f345-4e4b-9847-f04102398d2a/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_68706f7d-f345-4e4b-9847-f04102398d2a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_68706f7d-f345-4e4b-9847-f04102398d2a/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 221d8ee995a69c986b355f515c858471b19e54a2 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_68706f7d-f345-4e4b-9847-f04102398d2a/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_68706f7d-f345-4e4b-9847-f04102398d2a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_68706f7d-f345-4e4b-9847-f04102398d2a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_68706f7d-f345-4e4b-9847-f04102398d2a/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_68706f7d-f345-4e4b-9847-f04102398d2a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_68706f7d-f345-4e4b-9847-f04102398d2a/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 221d8ee995a69c986b355f515c858471b19e54a2 .................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: Unsupported type(() : VOID) --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:37:20,695 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:37:20,697 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:37:20,707 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:37:20,707 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:37:20,708 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:37:20,709 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:37:20,711 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:37:20,713 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:37:20,713 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:37:20,714 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:37:20,715 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:37:20,716 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:37:20,717 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:37:20,717 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:37:20,718 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:37:20,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:37:20,720 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:37:20,722 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:37:20,724 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:37:20,725 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:37:20,726 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:37:20,727 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:37:20,728 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:37:20,730 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:37:20,730 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:37:20,730 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:37:20,731 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:37:20,732 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:37:20,732 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:37:20,733 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:37:20,733 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:37:20,734 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:37:20,734 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:37:20,735 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:37:20,735 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:37:20,736 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:37:20,736 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:37:20,736 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:37:20,737 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:37:20,737 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:37:20,738 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_68706f7d-f345-4e4b-9847-f04102398d2a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:37:20,750 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:37:20,750 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:37:20,751 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:37:20,751 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:37:20,751 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:37:20,752 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:37:20,752 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:37:20,752 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:37:20,752 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:37:20,752 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:37:20,752 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:37:20,753 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:37:20,753 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:37:20,753 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:37:20,753 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:37:20,754 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:37:20,754 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:37:20,754 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:37:20,754 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:37:20,754 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:37:20,755 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:37:20,755 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:37:20,755 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:37:20,755 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:37:20,755 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:37:20,755 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:37:20,756 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:37:20,756 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:37:20,756 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:37:20,756 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:37:20,756 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:37:20,757 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:37:20,757 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:37:20,757 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:37:20,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:37:20,757 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:37:20,757 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:37:20,758 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_68706f7d-f345-4e4b-9847-f04102398d2a/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 -> 221d8ee995a69c986b355f515c858471b19e54a2 [2019-11-26 02:37:20,914 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:37:20,924 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:37:20,927 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:37:20,929 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:37:20,929 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:37:20,930 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_68706f7d-f345-4e4b-9847-f04102398d2a/bin/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-1.c [2019-11-26 02:37:20,977 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_68706f7d-f345-4e4b-9847-f04102398d2a/bin/utaipan/data/8d6db9e7a/c47ce2920a094822912d687b3cea237d/FLAGf64b33a00 [2019-11-26 02:37:21,574 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:37:21,575 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_68706f7d-f345-4e4b-9847-f04102398d2a/sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-1.c [2019-11-26 02:37:21,601 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_68706f7d-f345-4e4b-9847-f04102398d2a/bin/utaipan/data/8d6db9e7a/c47ce2920a094822912d687b3cea237d/FLAGf64b33a00 [2019-11-26 02:37:21,996 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_68706f7d-f345-4e4b-9847-f04102398d2a/bin/utaipan/data/8d6db9e7a/c47ce2920a094822912d687b3cea237d [2019-11-26 02:37:21,999 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:37:22,000 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:37:22,001 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:37:22,001 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:37:22,004 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:37:22,005 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:37:21" (1/1) ... [2019-11-26 02:37:22,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@66e5d7bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:22, skipping insertion in model container [2019-11-26 02:37:22,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:37:21" (1/1) ... [2019-11-26 02:37:22,014 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:37:22,067 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:37:22,543 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:37:22,563 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:37:22,707 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:37:22,730 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:37:22,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:22 WrapperNode [2019-11-26 02:37:22,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:37:22,732 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:37:22,732 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:37:22,732 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:37:22,739 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:22" (1/1) ... [2019-11-26 02:37:22,776 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:22" (1/1) ... [2019-11-26 02:37:22,838 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:37:22,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:37:22,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:37:22,846 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:37:22,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:22" (1/1) ... [2019-11-26 02:37:22,854 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:22" (1/1) ... [2019-11-26 02:37:22,860 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:22" (1/1) ... [2019-11-26 02:37:22,861 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:22" (1/1) ... [2019-11-26 02:37:22,901 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:22" (1/1) ... [2019-11-26 02:37:22,909 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:22" (1/1) ... [2019-11-26 02:37:22,913 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:22" (1/1) ... [2019-11-26 02:37:22,919 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:37:22,919 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:37:22,919 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:37:22,920 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:37:22,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68706f7d-f345-4e4b-9847-f04102398d2a/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-11-26 02:37:22,986 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-26 02:37:22,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-26 02:37:22,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 02:37:22,987 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-26 02:37:22,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-26 02:37:22,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-26 02:37:22,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-26 02:37:22,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 02:37:22,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:37:22,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:37:23,165 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 02:37:24,042 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-26 02:37:24,042 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-26 02:37:24,825 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:37:24,825 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:37:24,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:37:24 BoogieIcfgContainer [2019-11-26 02:37:24,826 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:37:24,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:37:24,828 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:37:24,830 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:37:24,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:37:21" (1/3) ... [2019-11-26 02:37:24,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c018c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:37:24, skipping insertion in model container [2019-11-26 02:37:24,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:22" (2/3) ... [2019-11-26 02:37:24,832 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c018c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:37:24, skipping insertion in model container [2019-11-26 02:37:24,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:37:24" (3/3) ... [2019-11-26 02:37:24,834 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.15.i.cil-1.c [2019-11-26 02:37:24,842 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:37:24,851 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:37:24,861 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:37:24,889 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:37:24,889 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:37:24,889 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:37:24,889 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:37:24,889 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:37:24,890 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:37:24,890 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:37:24,890 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:37:24,912 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2019-11-26 02:37:24,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-26 02:37:24,925 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:24,926 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] [2019-11-26 02:37:24,926 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:24,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:24,931 INFO L82 PathProgramCache]: Analyzing trace with hash -333414580, now seen corresponding path program 1 times [2019-11-26 02:37:24,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:24,941 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005539536] [2019-11-26 02:37:24,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:25,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:25,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:37:25,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005539536] [2019-11-26 02:37:25,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:25,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:37:25,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456229506] [2019-11-26 02:37:25,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:37:25,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:25,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:37:25,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:25,333 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 4 states. [2019-11-26 02:37:25,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:25,766 INFO L93 Difference]: Finished difference Result 243 states and 420 transitions. [2019-11-26 02:37:25,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:25,769 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-26 02:37:25,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:25,790 INFO L225 Difference]: With dead ends: 243 [2019-11-26 02:37:25,790 INFO L226 Difference]: Without dead ends: 129 [2019-11-26 02:37:25,794 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:37:25,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-26 02:37:25,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2019-11-26 02:37:25,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-26 02:37:25,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 179 transitions. [2019-11-26 02:37:25,857 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 179 transitions. Word has length 37 [2019-11-26 02:37:25,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:25,858 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 179 transitions. [2019-11-26 02:37:25,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:37:25,859 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 179 transitions. [2019-11-26 02:37:25,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-26 02:37:25,862 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:25,863 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-26 02:37:25,863 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:25,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:25,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1490508843, now seen corresponding path program 1 times [2019-11-26 02:37:25,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:25,864 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469511411] [2019-11-26 02:37:25,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:25,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:37:25,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469511411] [2019-11-26 02:37:25,991 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:25,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:37:25,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631805934] [2019-11-26 02:37:25,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:37:25,994 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:25,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:37:25,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:25,994 INFO L87 Difference]: Start difference. First operand 117 states and 179 transitions. Second operand 4 states. [2019-11-26 02:37:26,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:26,344 INFO L93 Difference]: Finished difference Result 234 states and 352 transitions. [2019-11-26 02:37:26,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:26,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-26 02:37:26,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:26,346 INFO L225 Difference]: With dead ends: 234 [2019-11-26 02:37:26,346 INFO L226 Difference]: Without dead ends: 129 [2019-11-26 02:37:26,348 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:37:26,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-26 02:37:26,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2019-11-26 02:37:26,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-26 02:37:26,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 178 transitions. [2019-11-26 02:37:26,357 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 178 transitions. Word has length 47 [2019-11-26 02:37:26,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:26,358 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 178 transitions. [2019-11-26 02:37:26,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:37:26,358 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 178 transitions. [2019-11-26 02:37:26,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-26 02:37:26,360 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:26,360 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-26 02:37:26,361 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:26,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:26,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1772833803, now seen corresponding path program 1 times [2019-11-26 02:37:26,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:26,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94390231] [2019-11-26 02:37:26,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:26,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:26,465 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:37:26,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94390231] [2019-11-26 02:37:26,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:26,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:37:26,467 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536576934] [2019-11-26 02:37:26,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:37:26,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:26,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:37:26,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:26,474 INFO L87 Difference]: Start difference. First operand 117 states and 178 transitions. Second operand 4 states. [2019-11-26 02:37:26,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:26,828 INFO L93 Difference]: Finished difference Result 234 states and 351 transitions. [2019-11-26 02:37:26,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:26,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-26 02:37:26,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:26,830 INFO L225 Difference]: With dead ends: 234 [2019-11-26 02:37:26,831 INFO L226 Difference]: Without dead ends: 129 [2019-11-26 02:37:26,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:37:26,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-26 02:37:26,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2019-11-26 02:37:26,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-26 02:37:26,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 177 transitions. [2019-11-26 02:37:26,840 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 177 transitions. Word has length 48 [2019-11-26 02:37:26,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:26,840 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 177 transitions. [2019-11-26 02:37:26,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:37:26,841 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 177 transitions. [2019-11-26 02:37:26,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-26 02:37:26,842 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:26,843 INFO L410 BasicCegarLoop]: trace histogram [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-11-26 02:37:26,843 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:26,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:26,843 INFO L82 PathProgramCache]: Analyzing trace with hash -827840818, now seen corresponding path program 1 times [2019-11-26 02:37:26,843 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:26,844 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2026939979] [2019-11-26 02:37:26,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:26,893 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:37:26,893 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2026939979] [2019-11-26 02:37:26,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:26,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:37:26,894 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799494913] [2019-11-26 02:37:26,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:37:26,894 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:26,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:37:26,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:26,895 INFO L87 Difference]: Start difference. First operand 117 states and 177 transitions. Second operand 4 states. [2019-11-26 02:37:27,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:27,197 INFO L93 Difference]: Finished difference Result 234 states and 350 transitions. [2019-11-26 02:37:27,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:27,199 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-26 02:37:27,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:27,200 INFO L225 Difference]: With dead ends: 234 [2019-11-26 02:37:27,200 INFO L226 Difference]: Without dead ends: 129 [2019-11-26 02:37:27,201 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:37:27,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-26 02:37:27,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2019-11-26 02:37:27,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-26 02:37:27,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 176 transitions. [2019-11-26 02:37:27,213 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 176 transitions. Word has length 49 [2019-11-26 02:37:27,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:27,214 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 176 transitions. [2019-11-26 02:37:27,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:37:27,214 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 176 transitions. [2019-11-26 02:37:27,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-26 02:37:27,218 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:27,218 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-26 02:37:27,219 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:27,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:27,219 INFO L82 PathProgramCache]: Analyzing trace with hash -202213895, now seen corresponding path program 1 times [2019-11-26 02:37:27,219 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:27,219 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833651349] [2019-11-26 02:37:27,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:27,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:27,308 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:37:27,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833651349] [2019-11-26 02:37:27,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:27,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:37:27,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826282525] [2019-11-26 02:37:27,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:37:27,310 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:27,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:37:27,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:27,310 INFO L87 Difference]: Start difference. First operand 117 states and 176 transitions. Second operand 4 states. [2019-11-26 02:37:27,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:27,633 INFO L93 Difference]: Finished difference Result 234 states and 349 transitions. [2019-11-26 02:37:27,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:27,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-26 02:37:27,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:27,635 INFO L225 Difference]: With dead ends: 234 [2019-11-26 02:37:27,636 INFO L226 Difference]: Without dead ends: 129 [2019-11-26 02:37:27,636 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:37:27,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-26 02:37:27,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2019-11-26 02:37:27,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-26 02:37:27,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 175 transitions. [2019-11-26 02:37:27,651 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 175 transitions. Word has length 49 [2019-11-26 02:37:27,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:27,653 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 175 transitions. [2019-11-26 02:37:27,653 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:37:27,653 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 175 transitions. [2019-11-26 02:37:27,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-26 02:37:27,655 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:27,655 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:37:27,655 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:27,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:27,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1195851026, now seen corresponding path program 1 times [2019-11-26 02:37:27,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:27,656 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141572336] [2019-11-26 02:37:27,656 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:27,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:27,736 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:37:27,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141572336] [2019-11-26 02:37:27,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:27,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:37:27,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227477971] [2019-11-26 02:37:27,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:37:27,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:27,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:37:27,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:27,738 INFO L87 Difference]: Start difference. First operand 117 states and 175 transitions. Second operand 4 states. [2019-11-26 02:37:28,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:28,045 INFO L93 Difference]: Finished difference Result 234 states and 348 transitions. [2019-11-26 02:37:28,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:28,048 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-26 02:37:28,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:28,049 INFO L225 Difference]: With dead ends: 234 [2019-11-26 02:37:28,049 INFO L226 Difference]: Without dead ends: 129 [2019-11-26 02:37:28,050 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:37:28,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-26 02:37:28,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2019-11-26 02:37:28,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-26 02:37:28,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 174 transitions. [2019-11-26 02:37:28,056 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 174 transitions. Word has length 49 [2019-11-26 02:37:28,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:28,056 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 174 transitions. [2019-11-26 02:37:28,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:37:28,056 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 174 transitions. [2019-11-26 02:37:28,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-26 02:37:28,057 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:28,061 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:37:28,061 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:28,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:28,062 INFO L82 PathProgramCache]: Analyzing trace with hash -672877754, now seen corresponding path program 1 times [2019-11-26 02:37:28,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:28,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701174493] [2019-11-26 02:37:28,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:28,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:28,127 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:37:28,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701174493] [2019-11-26 02:37:28,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:28,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:37:28,127 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505467807] [2019-11-26 02:37:28,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:37:28,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:28,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:37:28,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:28,128 INFO L87 Difference]: Start difference. First operand 117 states and 174 transitions. Second operand 4 states. [2019-11-26 02:37:28,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:28,380 INFO L93 Difference]: Finished difference Result 234 states and 347 transitions. [2019-11-26 02:37:28,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:28,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-26 02:37:28,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:28,382 INFO L225 Difference]: With dead ends: 234 [2019-11-26 02:37:28,383 INFO L226 Difference]: Without dead ends: 129 [2019-11-26 02:37:28,383 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:37:28,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-26 02:37:28,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2019-11-26 02:37:28,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-26 02:37:28,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 173 transitions. [2019-11-26 02:37:28,388 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 173 transitions. Word has length 50 [2019-11-26 02:37:28,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:28,389 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 173 transitions. [2019-11-26 02:37:28,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:37:28,389 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 173 transitions. [2019-11-26 02:37:28,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-26 02:37:28,389 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:28,390 INFO L410 BasicCegarLoop]: trace histogram [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-11-26 02:37:28,390 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:28,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:28,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1536232662, now seen corresponding path program 1 times [2019-11-26 02:37:28,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:28,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757751234] [2019-11-26 02:37:28,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:28,438 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:37:28,438 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757751234] [2019-11-26 02:37:28,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:28,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:37:28,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621924942] [2019-11-26 02:37:28,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:37:28,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:28,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:37:28,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:28,439 INFO L87 Difference]: Start difference. First operand 117 states and 173 transitions. Second operand 4 states. [2019-11-26 02:37:28,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:28,681 INFO L93 Difference]: Finished difference Result 232 states and 344 transitions. [2019-11-26 02:37:28,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:28,681 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-26 02:37:28,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:28,682 INFO L225 Difference]: With dead ends: 232 [2019-11-26 02:37:28,682 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:37:28,683 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:37:28,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:37:28,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 117. [2019-11-26 02:37:28,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-26 02:37:28,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 172 transitions. [2019-11-26 02:37:28,686 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 172 transitions. Word has length 50 [2019-11-26 02:37:28,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:28,687 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 172 transitions. [2019-11-26 02:37:28,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:37:28,687 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 172 transitions. [2019-11-26 02:37:28,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-26 02:37:28,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:28,688 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-26 02:37:28,688 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:28,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:28,688 INFO L82 PathProgramCache]: Analyzing trace with hash -992492375, now seen corresponding path program 1 times [2019-11-26 02:37:28,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:28,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480972564] [2019-11-26 02:37:28,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:28,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:28,749 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:37:28,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480972564] [2019-11-26 02:37:28,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:28,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:37:28,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055976946] [2019-11-26 02:37:28,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:37:28,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:28,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:37:28,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:28,751 INFO L87 Difference]: Start difference. First operand 117 states and 172 transitions. Second operand 4 states. [2019-11-26 02:37:28,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:28,966 INFO L93 Difference]: Finished difference Result 224 states and 333 transitions. [2019-11-26 02:37:28,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:28,967 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-26 02:37:28,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:28,968 INFO L225 Difference]: With dead ends: 224 [2019-11-26 02:37:28,968 INFO L226 Difference]: Without dead ends: 119 [2019-11-26 02:37:28,968 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:37:28,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-26 02:37:28,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2019-11-26 02:37:28,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-26 02:37:28,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 171 transitions. [2019-11-26 02:37:28,973 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 171 transitions. Word has length 51 [2019-11-26 02:37:28,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:28,973 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 171 transitions. [2019-11-26 02:37:28,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:37:28,973 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 171 transitions. [2019-11-26 02:37:28,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-26 02:37:28,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:28,974 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:37:28,974 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:28,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:28,974 INFO L82 PathProgramCache]: Analyzing trace with hash 156934145, now seen corresponding path program 1 times [2019-11-26 02:37:28,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:28,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807457708] [2019-11-26 02:37:28,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:29,024 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:37:29,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807457708] [2019-11-26 02:37:29,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:29,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:37:29,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300812902] [2019-11-26 02:37:29,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:37:29,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:29,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:37:29,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:29,026 INFO L87 Difference]: Start difference. First operand 117 states and 171 transitions. Second operand 4 states. [2019-11-26 02:37:29,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:29,325 INFO L93 Difference]: Finished difference Result 256 states and 381 transitions. [2019-11-26 02:37:29,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:29,327 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-26 02:37:29,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:29,328 INFO L225 Difference]: With dead ends: 256 [2019-11-26 02:37:29,328 INFO L226 Difference]: Without dead ends: 151 [2019-11-26 02:37:29,329 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-11-26 02:37:29,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-26 02:37:29,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 137. [2019-11-26 02:37:29,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-26 02:37:29,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 205 transitions. [2019-11-26 02:37:29,337 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 205 transitions. Word has length 52 [2019-11-26 02:37:29,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:29,337 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 205 transitions. [2019-11-26 02:37:29,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:37:29,338 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 205 transitions. [2019-11-26 02:37:29,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-26 02:37:29,339 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:29,339 INFO L410 BasicCegarLoop]: trace histogram [3, 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] [2019-11-26 02:37:29,339 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:29,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:29,340 INFO L82 PathProgramCache]: Analyzing trace with hash -538106294, now seen corresponding path program 1 times [2019-11-26 02:37:29,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:29,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111743815] [2019-11-26 02:37:29,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:29,409 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:37:29,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111743815] [2019-11-26 02:37:29,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:29,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:37:29,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423101538] [2019-11-26 02:37:29,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:37:29,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:29,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:37:29,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:29,411 INFO L87 Difference]: Start difference. First operand 137 states and 205 transitions. Second operand 4 states. [2019-11-26 02:37:29,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:29,731 INFO L93 Difference]: Finished difference Result 276 states and 414 transitions. [2019-11-26 02:37:29,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:29,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-26 02:37:29,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:29,733 INFO L225 Difference]: With dead ends: 276 [2019-11-26 02:37:29,733 INFO L226 Difference]: Without dead ends: 151 [2019-11-26 02:37:29,734 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-11-26 02:37:29,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-26 02:37:29,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 137. [2019-11-26 02:37:29,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-26 02:37:29,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 204 transitions. [2019-11-26 02:37:29,738 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 204 transitions. Word has length 62 [2019-11-26 02:37:29,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:29,739 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 204 transitions. [2019-11-26 02:37:29,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:37:29,739 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 204 transitions. [2019-11-26 02:37:29,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-26 02:37:29,740 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:29,740 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-26 02:37:29,740 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:29,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:29,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1232541750, now seen corresponding path program 1 times [2019-11-26 02:37:29,741 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:29,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523258045] [2019-11-26 02:37:29,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:29,852 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-26 02:37:29,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523258045] [2019-11-26 02:37:29,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:29,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:37:29,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427612471] [2019-11-26 02:37:29,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:37:29,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:29,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:37:29,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:37:29,855 INFO L87 Difference]: Start difference. First operand 137 states and 204 transitions. Second operand 5 states. [2019-11-26 02:37:30,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:30,218 INFO L93 Difference]: Finished difference Result 279 states and 419 transitions. [2019-11-26 02:37:30,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:37:30,219 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-11-26 02:37:30,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:30,220 INFO L225 Difference]: With dead ends: 279 [2019-11-26 02:37:30,220 INFO L226 Difference]: Without dead ends: 154 [2019-11-26 02:37:30,221 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:37:30,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-26 02:37:30,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-11-26 02:37:30,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-26 02:37:30,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 224 transitions. [2019-11-26 02:37:30,227 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 224 transitions. Word has length 63 [2019-11-26 02:37:30,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:30,228 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 224 transitions. [2019-11-26 02:37:30,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:37:30,228 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 224 transitions. [2019-11-26 02:37:30,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-26 02:37:30,229 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:30,229 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:37:30,229 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:30,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:30,229 INFO L82 PathProgramCache]: Analyzing trace with hash 228601646, now seen corresponding path program 1 times [2019-11-26 02:37:30,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:30,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966416045] [2019-11-26 02:37:30,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:30,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:30,313 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:37:30,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966416045] [2019-11-26 02:37:30,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:30,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:37:30,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287726129] [2019-11-26 02:37:30,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:37:30,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:30,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:37:30,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:30,315 INFO L87 Difference]: Start difference. First operand 153 states and 224 transitions. Second operand 4 states. [2019-11-26 02:37:30,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:30,642 INFO L93 Difference]: Finished difference Result 308 states and 451 transitions. [2019-11-26 02:37:30,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:30,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-26 02:37:30,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:30,644 INFO L225 Difference]: With dead ends: 308 [2019-11-26 02:37:30,644 INFO L226 Difference]: Without dead ends: 167 [2019-11-26 02:37:30,645 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-11-26 02:37:30,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-11-26 02:37:30,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 153. [2019-11-26 02:37:30,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-26 02:37:30,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 223 transitions. [2019-11-26 02:37:30,650 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 223 transitions. Word has length 64 [2019-11-26 02:37:30,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:30,651 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 223 transitions. [2019-11-26 02:37:30,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:37:30,651 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 223 transitions. [2019-11-26 02:37:30,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-26 02:37:30,651 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:30,652 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:37:30,652 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:30,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:30,652 INFO L82 PathProgramCache]: Analyzing trace with hash 1626666567, now seen corresponding path program 1 times [2019-11-26 02:37:30,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:30,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342041273] [2019-11-26 02:37:30,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:30,714 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:37:30,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342041273] [2019-11-26 02:37:30,715 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:30,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:37:30,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213436689] [2019-11-26 02:37:30,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:37:30,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:30,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:37:30,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:30,717 INFO L87 Difference]: Start difference. First operand 153 states and 223 transitions. Second operand 4 states. [2019-11-26 02:37:31,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:31,053 INFO L93 Difference]: Finished difference Result 308 states and 449 transitions. [2019-11-26 02:37:31,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:31,054 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-26 02:37:31,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:31,055 INFO L225 Difference]: With dead ends: 308 [2019-11-26 02:37:31,055 INFO L226 Difference]: Without dead ends: 167 [2019-11-26 02:37:31,057 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-11-26 02:37:31,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-11-26 02:37:31,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 153. [2019-11-26 02:37:31,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-26 02:37:31,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 222 transitions. [2019-11-26 02:37:31,062 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 222 transitions. Word has length 64 [2019-11-26 02:37:31,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:31,063 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 222 transitions. [2019-11-26 02:37:31,063 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:37:31,063 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 222 transitions. [2019-11-26 02:37:31,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-26 02:37:31,064 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:31,064 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-26 02:37:31,064 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:31,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:31,064 INFO L82 PathProgramCache]: Analyzing trace with hash 609298804, now seen corresponding path program 1 times [2019-11-26 02:37:31,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:31,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923088549] [2019-11-26 02:37:31,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:31,110 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:37:31,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923088549] [2019-11-26 02:37:31,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:31,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:37:31,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321576077] [2019-11-26 02:37:31,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:37:31,112 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:31,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:37:31,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:31,112 INFO L87 Difference]: Start difference. First operand 153 states and 222 transitions. Second operand 4 states. [2019-11-26 02:37:31,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:31,441 INFO L93 Difference]: Finished difference Result 308 states and 447 transitions. [2019-11-26 02:37:31,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:31,442 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-26 02:37:31,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:31,443 INFO L225 Difference]: With dead ends: 308 [2019-11-26 02:37:31,444 INFO L226 Difference]: Without dead ends: 167 [2019-11-26 02:37:31,444 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-11-26 02:37:31,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-11-26 02:37:31,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 153. [2019-11-26 02:37:31,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-26 02:37:31,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 221 transitions. [2019-11-26 02:37:31,450 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 221 transitions. Word has length 64 [2019-11-26 02:37:31,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:31,450 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 221 transitions. [2019-11-26 02:37:31,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:37:31,450 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 221 transitions. [2019-11-26 02:37:31,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-26 02:37:31,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:31,451 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:37:31,451 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:31,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:31,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1632328519, now seen corresponding path program 1 times [2019-11-26 02:37:31,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:31,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922181329] [2019-11-26 02:37:31,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:31,511 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:37:31,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922181329] [2019-11-26 02:37:31,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:31,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:37:31,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851556919] [2019-11-26 02:37:31,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:37:31,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:31,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:37:31,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:31,513 INFO L87 Difference]: Start difference. First operand 153 states and 221 transitions. Second operand 4 states. [2019-11-26 02:37:31,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:31,861 INFO L93 Difference]: Finished difference Result 308 states and 445 transitions. [2019-11-26 02:37:31,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:31,862 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-26 02:37:31,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:31,863 INFO L225 Difference]: With dead ends: 308 [2019-11-26 02:37:31,864 INFO L226 Difference]: Without dead ends: 167 [2019-11-26 02:37:31,864 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-11-26 02:37:31,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-11-26 02:37:31,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 153. [2019-11-26 02:37:31,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-26 02:37:31,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 220 transitions. [2019-11-26 02:37:31,871 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 220 transitions. Word has length 65 [2019-11-26 02:37:31,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:31,872 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 220 transitions. [2019-11-26 02:37:31,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:37:31,872 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 220 transitions. [2019-11-26 02:37:31,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-26 02:37:31,873 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:31,873 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:37:31,873 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:31,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:31,874 INFO L82 PathProgramCache]: Analyzing trace with hash 2006612545, now seen corresponding path program 1 times [2019-11-26 02:37:31,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:31,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101983402] [2019-11-26 02:37:31,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:31,921 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:37:31,922 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101983402] [2019-11-26 02:37:31,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:31,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:37:31,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148634732] [2019-11-26 02:37:31,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:37:31,923 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:31,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:37:31,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:31,923 INFO L87 Difference]: Start difference. First operand 153 states and 220 transitions. Second operand 4 states. [2019-11-26 02:37:32,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:32,241 INFO L93 Difference]: Finished difference Result 306 states and 441 transitions. [2019-11-26 02:37:32,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:32,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-26 02:37:32,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:32,244 INFO L225 Difference]: With dead ends: 306 [2019-11-26 02:37:32,244 INFO L226 Difference]: Without dead ends: 165 [2019-11-26 02:37:32,244 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-11-26 02:37:32,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-26 02:37:32,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 153. [2019-11-26 02:37:32,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-26 02:37:32,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 219 transitions. [2019-11-26 02:37:32,251 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 219 transitions. Word has length 65 [2019-11-26 02:37:32,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:32,252 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 219 transitions. [2019-11-26 02:37:32,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:37:32,252 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 219 transitions. [2019-11-26 02:37:32,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-26 02:37:32,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:32,253 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:37:32,253 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:32,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:32,254 INFO L82 PathProgramCache]: Analyzing trace with hash -927256487, now seen corresponding path program 1 times [2019-11-26 02:37:32,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:32,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516931834] [2019-11-26 02:37:32,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:32,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:32,300 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:37:32,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516931834] [2019-11-26 02:37:32,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:32,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:37:32,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718508749] [2019-11-26 02:37:32,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:37:32,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:32,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:37:32,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:32,307 INFO L87 Difference]: Start difference. First operand 153 states and 219 transitions. Second operand 4 states. [2019-11-26 02:37:32,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:32,673 INFO L93 Difference]: Finished difference Result 306 states and 439 transitions. [2019-11-26 02:37:32,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:32,674 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-26 02:37:32,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:32,675 INFO L225 Difference]: With dead ends: 306 [2019-11-26 02:37:32,676 INFO L226 Difference]: Without dead ends: 165 [2019-11-26 02:37:32,676 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-11-26 02:37:32,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-26 02:37:32,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 153. [2019-11-26 02:37:32,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-26 02:37:32,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 218 transitions. [2019-11-26 02:37:32,681 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 218 transitions. Word has length 66 [2019-11-26 02:37:32,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:32,682 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 218 transitions. [2019-11-26 02:37:32,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:37:32,682 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 218 transitions. [2019-11-26 02:37:32,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-26 02:37:32,683 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:32,683 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:37:32,683 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:32,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:32,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1416219148, now seen corresponding path program 1 times [2019-11-26 02:37:32,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:32,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182522658] [2019-11-26 02:37:32,684 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:32,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:32,724 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:37:32,724 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182522658] [2019-11-26 02:37:32,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:32,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:37:32,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558091079] [2019-11-26 02:37:32,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:37:32,725 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:32,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:37:32,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:32,725 INFO L87 Difference]: Start difference. First operand 153 states and 218 transitions. Second operand 4 states. [2019-11-26 02:37:33,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:33,033 INFO L93 Difference]: Finished difference Result 298 states and 428 transitions. [2019-11-26 02:37:33,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:33,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-26 02:37:33,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:33,036 INFO L225 Difference]: With dead ends: 298 [2019-11-26 02:37:33,036 INFO L226 Difference]: Without dead ends: 157 [2019-11-26 02:37:33,036 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-11-26 02:37:33,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-26 02:37:33,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2019-11-26 02:37:33,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-26 02:37:33,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 217 transitions. [2019-11-26 02:37:33,042 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 217 transitions. Word has length 67 [2019-11-26 02:37:33,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:33,042 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 217 transitions. [2019-11-26 02:37:33,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:37:33,042 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 217 transitions. [2019-11-26 02:37:33,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-26 02:37:33,043 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:33,043 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:37:33,044 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:33,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:33,044 INFO L82 PathProgramCache]: Analyzing trace with hash -2039542756, now seen corresponding path program 1 times [2019-11-26 02:37:33,044 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:33,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390960708] [2019-11-26 02:37:33,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:33,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:33,155 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-26 02:37:33,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390960708] [2019-11-26 02:37:33,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:33,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:37:33,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419949157] [2019-11-26 02:37:33,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:37:33,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:33,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:37:33,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:37:33,157 INFO L87 Difference]: Start difference. First operand 153 states and 217 transitions. Second operand 6 states. [2019-11-26 02:37:33,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:33,806 INFO L93 Difference]: Finished difference Result 390 states and 565 transitions. [2019-11-26 02:37:33,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:37:33,807 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-11-26 02:37:33,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:33,809 INFO L225 Difference]: With dead ends: 390 [2019-11-26 02:37:33,809 INFO L226 Difference]: Without dead ends: 249 [2019-11-26 02:37:33,809 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:37:33,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-11-26 02:37:33,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 190. [2019-11-26 02:37:33,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-26 02:37:33,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 284 transitions. [2019-11-26 02:37:33,817 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 284 transitions. Word has length 70 [2019-11-26 02:37:33,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:33,817 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 284 transitions. [2019-11-26 02:37:33,817 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:37:33,818 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 284 transitions. [2019-11-26 02:37:33,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 02:37:33,819 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:33,819 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:37:33,819 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:33,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:33,819 INFO L82 PathProgramCache]: Analyzing trace with hash -780908332, now seen corresponding path program 1 times [2019-11-26 02:37:33,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:33,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195166824] [2019-11-26 02:37:33,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:33,941 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-26 02:37:33,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195166824] [2019-11-26 02:37:33,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:33,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:37:33,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2100661148] [2019-11-26 02:37:33,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:37:33,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:33,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:37:33,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:37:33,944 INFO L87 Difference]: Start difference. First operand 190 states and 284 transitions. Second operand 6 states. [2019-11-26 02:37:34,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:34,567 INFO L93 Difference]: Finished difference Result 420 states and 622 transitions. [2019-11-26 02:37:34,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:37:34,568 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-11-26 02:37:34,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:34,569 INFO L225 Difference]: With dead ends: 420 [2019-11-26 02:37:34,570 INFO L226 Difference]: Without dead ends: 242 [2019-11-26 02:37:34,570 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:37:34,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-26 02:37:34,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 191. [2019-11-26 02:37:34,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-26 02:37:34,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 285 transitions. [2019-11-26 02:37:34,578 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 285 transitions. Word has length 71 [2019-11-26 02:37:34,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:34,578 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 285 transitions. [2019-11-26 02:37:34,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:37:34,579 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 285 transitions. [2019-11-26 02:37:34,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-26 02:37:34,579 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:34,580 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-11-26 02:37:34,580 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:34,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:34,580 INFO L82 PathProgramCache]: Analyzing trace with hash -79410487, now seen corresponding path program 1 times [2019-11-26 02:37:34,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:34,580 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500581596] [2019-11-26 02:37:34,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:34,653 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-26 02:37:34,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500581596] [2019-11-26 02:37:34,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:34,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:37:34,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142087467] [2019-11-26 02:37:34,655 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:37:34,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:34,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:37:34,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:34,655 INFO L87 Difference]: Start difference. First operand 191 states and 285 transitions. Second operand 4 states. [2019-11-26 02:37:35,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:35,098 INFO L93 Difference]: Finished difference Result 432 states and 652 transitions. [2019-11-26 02:37:35,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:35,100 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-26 02:37:35,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:35,102 INFO L225 Difference]: With dead ends: 432 [2019-11-26 02:37:35,102 INFO L226 Difference]: Without dead ends: 253 [2019-11-26 02:37:35,102 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-11-26 02:37:35,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-11-26 02:37:35,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 221. [2019-11-26 02:37:35,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-11-26 02:37:35,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 338 transitions. [2019-11-26 02:37:35,111 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 338 transitions. Word has length 82 [2019-11-26 02:37:35,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:35,111 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 338 transitions. [2019-11-26 02:37:35,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:37:35,111 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 338 transitions. [2019-11-26 02:37:35,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-26 02:37:35,112 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:35,112 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:37:35,113 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:35,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:35,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1318654434, now seen corresponding path program 1 times [2019-11-26 02:37:35,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:35,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127308050] [2019-11-26 02:37:35,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:35,198 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-26 02:37:35,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127308050] [2019-11-26 02:37:35,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:35,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:37:35,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61855727] [2019-11-26 02:37:35,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:37:35,201 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:35,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:37:35,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:35,201 INFO L87 Difference]: Start difference. First operand 221 states and 338 transitions. Second operand 4 states. [2019-11-26 02:37:35,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:35,728 INFO L93 Difference]: Finished difference Result 522 states and 802 transitions. [2019-11-26 02:37:35,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:35,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-26 02:37:35,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:35,731 INFO L225 Difference]: With dead ends: 522 [2019-11-26 02:37:35,731 INFO L226 Difference]: Without dead ends: 313 [2019-11-26 02:37:35,732 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-11-26 02:37:35,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-11-26 02:37:35,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 258. [2019-11-26 02:37:35,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-26 02:37:35,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 405 transitions. [2019-11-26 02:37:35,742 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 405 transitions. Word has length 82 [2019-11-26 02:37:35,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:35,742 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 405 transitions. [2019-11-26 02:37:35,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:37:35,742 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 405 transitions. [2019-11-26 02:37:35,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-26 02:37:35,743 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:35,743 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-11-26 02:37:35,743 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:35,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:35,744 INFO L82 PathProgramCache]: Analyzing trace with hash 301286671, now seen corresponding path program 1 times [2019-11-26 02:37:35,744 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:35,744 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298449683] [2019-11-26 02:37:35,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:35,852 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-26 02:37:35,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298449683] [2019-11-26 02:37:35,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:35,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:37:35,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131247022] [2019-11-26 02:37:35,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:37:35,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:35,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:37:35,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:37:35,855 INFO L87 Difference]: Start difference. First operand 258 states and 405 transitions. Second operand 5 states. [2019-11-26 02:37:36,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:36,469 INFO L93 Difference]: Finished difference Result 606 states and 952 transitions. [2019-11-26 02:37:36,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:36,470 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-11-26 02:37:36,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:36,472 INFO L225 Difference]: With dead ends: 606 [2019-11-26 02:37:36,472 INFO L226 Difference]: Without dead ends: 360 [2019-11-26 02:37:36,473 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:37:36,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-11-26 02:37:36,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 258. [2019-11-26 02:37:36,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-26 02:37:36,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 405 transitions. [2019-11-26 02:37:36,482 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 405 transitions. Word has length 82 [2019-11-26 02:37:36,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:36,482 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 405 transitions. [2019-11-26 02:37:36,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:37:36,483 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 405 transitions. [2019-11-26 02:37:36,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-26 02:37:36,483 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:36,484 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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-11-26 02:37:36,484 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:36,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:36,484 INFO L82 PathProgramCache]: Analyzing trace with hash 243989454, now seen corresponding path program 1 times [2019-11-26 02:37:36,484 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:36,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963501567] [2019-11-26 02:37:36,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:36,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:36,542 INFO L134 CoverageAnalysis]: Checked inductivity of 69 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-26 02:37:36,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963501567] [2019-11-26 02:37:36,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:36,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:37:36,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496366096] [2019-11-26 02:37:36,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:37:36,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:36,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:37:36,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:36,544 INFO L87 Difference]: Start difference. First operand 258 states and 405 transitions. Second operand 4 states. [2019-11-26 02:37:37,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:37,078 INFO L93 Difference]: Finished difference Result 589 states and 926 transitions. [2019-11-26 02:37:37,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:37,080 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-11-26 02:37:37,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:37,082 INFO L225 Difference]: With dead ends: 589 [2019-11-26 02:37:37,082 INFO L226 Difference]: Without dead ends: 343 [2019-11-26 02:37:37,082 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-11-26 02:37:37,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-11-26 02:37:37,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 258. [2019-11-26 02:37:37,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-26 02:37:37,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 405 transitions. [2019-11-26 02:37:37,092 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 405 transitions. Word has length 83 [2019-11-26 02:37:37,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:37,093 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 405 transitions. [2019-11-26 02:37:37,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:37:37,093 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 405 transitions. [2019-11-26 02:37:37,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-26 02:37:37,094 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:37,094 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:37:37,096 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:37,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:37,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1229640127, now seen corresponding path program 1 times [2019-11-26 02:37:37,096 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:37,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035154882] [2019-11-26 02:37:37,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:37,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:37,196 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-26 02:37:37,196 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035154882] [2019-11-26 02:37:37,196 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:37,197 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:37:37,197 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322819045] [2019-11-26 02:37:37,197 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:37:37,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:37,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:37:37,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:37:37,198 INFO L87 Difference]: Start difference. First operand 258 states and 405 transitions. Second operand 5 states. [2019-11-26 02:37:37,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:37,715 INFO L93 Difference]: Finished difference Result 597 states and 940 transitions. [2019-11-26 02:37:37,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:37,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-11-26 02:37:37,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:37,717 INFO L225 Difference]: With dead ends: 597 [2019-11-26 02:37:37,718 INFO L226 Difference]: Without dead ends: 351 [2019-11-26 02:37:37,718 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:37:37,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-11-26 02:37:37,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 249. [2019-11-26 02:37:37,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-11-26 02:37:37,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 394 transitions. [2019-11-26 02:37:37,728 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 394 transitions. Word has length 83 [2019-11-26 02:37:37,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:37,729 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 394 transitions. [2019-11-26 02:37:37,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:37:37,729 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 394 transitions. [2019-11-26 02:37:37,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-26 02:37:37,730 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:37,730 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-26 02:37:37,730 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:37,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:37,731 INFO L82 PathProgramCache]: Analyzing trace with hash -1650223346, now seen corresponding path program 1 times [2019-11-26 02:37:37,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:37,731 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894977075] [2019-11-26 02:37:37,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:37,826 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-26 02:37:37,826 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894977075] [2019-11-26 02:37:37,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:37,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:37:37,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711057098] [2019-11-26 02:37:37,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:37:37,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:37,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:37:37,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:37:37,828 INFO L87 Difference]: Start difference. First operand 249 states and 394 transitions. Second operand 6 states. [2019-11-26 02:37:38,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:38,430 INFO L93 Difference]: Finished difference Result 572 states and 904 transitions. [2019-11-26 02:37:38,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:37:38,431 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-11-26 02:37:38,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:38,433 INFO L225 Difference]: With dead ends: 572 [2019-11-26 02:37:38,433 INFO L226 Difference]: Without dead ends: 335 [2019-11-26 02:37:38,434 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:37:38,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-11-26 02:37:38,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 279. [2019-11-26 02:37:38,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-11-26 02:37:38,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 447 transitions. [2019-11-26 02:37:38,444 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 447 transitions. Word has length 98 [2019-11-26 02:37:38,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:38,444 INFO L462 AbstractCegarLoop]: Abstraction has 279 states and 447 transitions. [2019-11-26 02:37:38,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:37:38,445 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 447 transitions. [2019-11-26 02:37:38,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-26 02:37:38,445 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:38,446 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-11-26 02:37:38,446 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:38,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:38,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1136817848, now seen corresponding path program 1 times [2019-11-26 02:37:38,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:38,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677296540] [2019-11-26 02:37:38,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:38,548 INFO L134 CoverageAnalysis]: Checked inductivity of 93 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-26 02:37:38,548 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677296540] [2019-11-26 02:37:38,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:38,549 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:37:38,549 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007098567] [2019-11-26 02:37:38,549 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:37:38,550 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:38,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:37:38,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:37:38,550 INFO L87 Difference]: Start difference. First operand 279 states and 447 transitions. Second operand 6 states. [2019-11-26 02:37:39,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:39,102 INFO L93 Difference]: Finished difference Result 602 states and 956 transitions. [2019-11-26 02:37:39,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:37:39,103 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2019-11-26 02:37:39,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:39,105 INFO L225 Difference]: With dead ends: 602 [2019-11-26 02:37:39,105 INFO L226 Difference]: Without dead ends: 335 [2019-11-26 02:37:39,105 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:37:39,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-11-26 02:37:39,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 284. [2019-11-26 02:37:39,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-11-26 02:37:39,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 456 transitions. [2019-11-26 02:37:39,115 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 456 transitions. Word has length 103 [2019-11-26 02:37:39,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:39,116 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 456 transitions. [2019-11-26 02:37:39,116 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:37:39,116 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 456 transitions. [2019-11-26 02:37:39,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-26 02:37:39,117 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:39,117 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-11-26 02:37:39,117 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:39,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:39,118 INFO L82 PathProgramCache]: Analyzing trace with hash -309385120, now seen corresponding path program 1 times [2019-11-26 02:37:39,118 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:39,118 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779050001] [2019-11-26 02:37:39,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:39,211 INFO L134 CoverageAnalysis]: Checked inductivity of 94 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-26 02:37:39,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779050001] [2019-11-26 02:37:39,211 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:39,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:37:39,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020349020] [2019-11-26 02:37:39,212 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:37:39,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:39,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:37:39,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:37:39,213 INFO L87 Difference]: Start difference. First operand 284 states and 456 transitions. Second operand 6 states. [2019-11-26 02:37:40,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:40,028 INFO L93 Difference]: Finished difference Result 605 states and 962 transitions. [2019-11-26 02:37:40,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:37:40,029 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2019-11-26 02:37:40,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:40,031 INFO L225 Difference]: With dead ends: 605 [2019-11-26 02:37:40,031 INFO L226 Difference]: Without dead ends: 333 [2019-11-26 02:37:40,031 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:37:40,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-11-26 02:37:40,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 285. [2019-11-26 02:37:40,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-11-26 02:37:40,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 457 transitions. [2019-11-26 02:37:40,044 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 457 transitions. Word has length 104 [2019-11-26 02:37:40,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:40,045 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 457 transitions. [2019-11-26 02:37:40,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:37:40,045 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 457 transitions. [2019-11-26 02:37:40,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-26 02:37:40,046 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:40,046 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2019-11-26 02:37:40,046 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:40,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:40,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1398575471, now seen corresponding path program 1 times [2019-11-26 02:37:40,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:40,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221932382] [2019-11-26 02:37:40,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:40,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:40,152 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-11-26 02:37:40,153 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221932382] [2019-11-26 02:37:40,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:40,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:37:40,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024329833] [2019-11-26 02:37:40,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:37:40,154 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:40,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:37:40,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:37:40,156 INFO L87 Difference]: Start difference. First operand 285 states and 457 transitions. Second operand 6 states. [2019-11-26 02:37:40,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:40,696 INFO L93 Difference]: Finished difference Result 601 states and 955 transitions. [2019-11-26 02:37:40,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:37:40,697 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2019-11-26 02:37:40,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:40,699 INFO L225 Difference]: With dead ends: 601 [2019-11-26 02:37:40,699 INFO L226 Difference]: Without dead ends: 328 [2019-11-26 02:37:40,699 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:37:40,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-11-26 02:37:40,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 288. [2019-11-26 02:37:40,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-11-26 02:37:40,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 460 transitions. [2019-11-26 02:37:40,710 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 460 transitions. Word has length 109 [2019-11-26 02:37:40,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:40,710 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 460 transitions. [2019-11-26 02:37:40,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:37:40,711 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 460 transitions. [2019-11-26 02:37:40,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-26 02:37:40,712 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:40,712 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2019-11-26 02:37:40,712 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:40,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:40,712 INFO L82 PathProgramCache]: Analyzing trace with hash 1967996987, now seen corresponding path program 1 times [2019-11-26 02:37:40,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:40,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330175817] [2019-11-26 02:37:40,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:40,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:40,787 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-26 02:37:40,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330175817] [2019-11-26 02:37:40,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:40,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:37:40,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405963753] [2019-11-26 02:37:40,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:37:40,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:40,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:37:40,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:40,789 INFO L87 Difference]: Start difference. First operand 288 states and 460 transitions. Second operand 4 states. [2019-11-26 02:37:41,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:41,270 INFO L93 Difference]: Finished difference Result 600 states and 952 transitions. [2019-11-26 02:37:41,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:41,270 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-11-26 02:37:41,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:41,272 INFO L225 Difference]: With dead ends: 600 [2019-11-26 02:37:41,272 INFO L226 Difference]: Without dead ends: 324 [2019-11-26 02:37:41,273 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-11-26 02:37:41,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-11-26 02:37:41,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 288. [2019-11-26 02:37:41,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-11-26 02:37:41,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 459 transitions. [2019-11-26 02:37:41,283 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 459 transitions. Word has length 110 [2019-11-26 02:37:41,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:41,283 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 459 transitions. [2019-11-26 02:37:41,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:37:41,283 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 459 transitions. [2019-11-26 02:37:41,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-26 02:37:41,284 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:41,285 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 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] [2019-11-26 02:37:41,286 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:41,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:41,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1712248788, now seen corresponding path program 1 times [2019-11-26 02:37:41,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:41,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221116783] [2019-11-26 02:37:41,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:41,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:41,358 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-26 02:37:41,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221116783] [2019-11-26 02:37:41,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:41,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:37:41,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455256896] [2019-11-26 02:37:41,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:37:41,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:41,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:37:41,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:41,360 INFO L87 Difference]: Start difference. First operand 288 states and 459 transitions. Second operand 4 states. [2019-11-26 02:37:41,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:41,870 INFO L93 Difference]: Finished difference Result 646 states and 1029 transitions. [2019-11-26 02:37:41,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:41,871 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-11-26 02:37:41,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:41,873 INFO L225 Difference]: With dead ends: 646 [2019-11-26 02:37:41,873 INFO L226 Difference]: Without dead ends: 370 [2019-11-26 02:37:41,873 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-11-26 02:37:41,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-11-26 02:37:41,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 318. [2019-11-26 02:37:41,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-11-26 02:37:41,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 512 transitions. [2019-11-26 02:37:41,886 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 512 transitions. Word has length 110 [2019-11-26 02:37:41,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:41,887 INFO L462 AbstractCegarLoop]: Abstraction has 318 states and 512 transitions. [2019-11-26 02:37:41,887 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:37:41,887 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 512 transitions. [2019-11-26 02:37:41,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-26 02:37:41,888 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:41,888 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-11-26 02:37:41,889 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:41,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:41,889 INFO L82 PathProgramCache]: Analyzing trace with hash -184830591, now seen corresponding path program 1 times [2019-11-26 02:37:41,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:41,889 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807693334] [2019-11-26 02:37:41,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:41,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:42,001 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-26 02:37:42,002 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807693334] [2019-11-26 02:37:42,002 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:42,002 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:37:42,002 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009287687] [2019-11-26 02:37:42,003 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:37:42,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:42,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:37:42,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:37:42,004 INFO L87 Difference]: Start difference. First operand 318 states and 512 transitions. Second operand 5 states. [2019-11-26 02:37:42,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:42,452 INFO L93 Difference]: Finished difference Result 760 states and 1228 transitions. [2019-11-26 02:37:42,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:42,452 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-11-26 02:37:42,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:42,455 INFO L225 Difference]: With dead ends: 760 [2019-11-26 02:37:42,455 INFO L226 Difference]: Without dead ends: 454 [2019-11-26 02:37:42,456 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:37:42,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-11-26 02:37:42,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 348. [2019-11-26 02:37:42,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-11-26 02:37:42,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 565 transitions. [2019-11-26 02:37:42,472 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 565 transitions. Word has length 110 [2019-11-26 02:37:42,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:42,472 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 565 transitions. [2019-11-26 02:37:42,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:37:42,472 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 565 transitions. [2019-11-26 02:37:42,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-26 02:37:42,474 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:42,474 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 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] [2019-11-26 02:37:42,474 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:42,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:42,475 INFO L82 PathProgramCache]: Analyzing trace with hash -2138326536, now seen corresponding path program 1 times [2019-11-26 02:37:42,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:42,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667891181] [2019-11-26 02:37:42,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:42,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:42,587 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 93 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-26 02:37:42,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667891181] [2019-11-26 02:37:42,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:42,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:37:42,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097032603] [2019-11-26 02:37:42,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:37:42,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:42,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:37:42,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:42,589 INFO L87 Difference]: Start difference. First operand 348 states and 565 transitions. Second operand 4 states. [2019-11-26 02:37:42,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:42,914 INFO L93 Difference]: Finished difference Result 718 states and 1160 transitions. [2019-11-26 02:37:42,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:42,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-11-26 02:37:42,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:42,917 INFO L225 Difference]: With dead ends: 718 [2019-11-26 02:37:42,917 INFO L226 Difference]: Without dead ends: 382 [2019-11-26 02:37:42,918 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-11-26 02:37:42,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-11-26 02:37:42,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 348. [2019-11-26 02:37:42,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-11-26 02:37:42,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 564 transitions. [2019-11-26 02:37:42,930 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 564 transitions. Word has length 111 [2019-11-26 02:37:42,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:42,930 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 564 transitions. [2019-11-26 02:37:42,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:37:42,930 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 564 transitions. [2019-11-26 02:37:42,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-26 02:37:42,932 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:42,932 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 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] [2019-11-26 02:37:42,932 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:42,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:42,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1908489806, now seen corresponding path program 1 times [2019-11-26 02:37:42,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:42,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915693556] [2019-11-26 02:37:42,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:42,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:42,998 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-26 02:37:42,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915693556] [2019-11-26 02:37:42,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:42,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:37:42,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549805277] [2019-11-26 02:37:42,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:37:42,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:42,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:37:42,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:43,000 INFO L87 Difference]: Start difference. First operand 348 states and 564 transitions. Second operand 4 states. [2019-11-26 02:37:43,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:43,347 INFO L93 Difference]: Finished difference Result 766 states and 1238 transitions. [2019-11-26 02:37:43,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:43,348 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-11-26 02:37:43,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:43,350 INFO L225 Difference]: With dead ends: 766 [2019-11-26 02:37:43,350 INFO L226 Difference]: Without dead ends: 430 [2019-11-26 02:37:43,351 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-11-26 02:37:43,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-11-26 02:37:43,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 383. [2019-11-26 02:37:43,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-11-26 02:37:43,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 626 transitions. [2019-11-26 02:37:43,364 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 626 transitions. Word has length 115 [2019-11-26 02:37:43,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:43,364 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 626 transitions. [2019-11-26 02:37:43,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:37:43,365 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 626 transitions. [2019-11-26 02:37:43,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-26 02:37:43,366 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:43,366 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-11-26 02:37:43,366 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:43,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:43,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1190500315, now seen corresponding path program 1 times [2019-11-26 02:37:43,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:43,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180798231] [2019-11-26 02:37:43,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:43,460 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-26 02:37:43,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180798231] [2019-11-26 02:37:43,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:43,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:37:43,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920465040] [2019-11-26 02:37:43,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:37:43,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:43,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:37:43,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:37:43,462 INFO L87 Difference]: Start difference. First operand 383 states and 626 transitions. Second operand 5 states. [2019-11-26 02:37:43,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:43,864 INFO L93 Difference]: Finished difference Result 856 states and 1391 transitions. [2019-11-26 02:37:43,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:43,864 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2019-11-26 02:37:43,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:43,867 INFO L225 Difference]: With dead ends: 856 [2019-11-26 02:37:43,867 INFO L226 Difference]: Without dead ends: 485 [2019-11-26 02:37:43,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:37:43,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-11-26 02:37:43,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 383. [2019-11-26 02:37:43,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-11-26 02:37:43,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 625 transitions. [2019-11-26 02:37:43,881 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 625 transitions. Word has length 115 [2019-11-26 02:37:43,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:43,882 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 625 transitions. [2019-11-26 02:37:43,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:37:43,882 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 625 transitions. [2019-11-26 02:37:43,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-26 02:37:43,883 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:43,883 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 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] [2019-11-26 02:37:43,884 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:43,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:43,884 INFO L82 PathProgramCache]: Analyzing trace with hash -224641882, now seen corresponding path program 1 times [2019-11-26 02:37:43,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:43,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254024663] [2019-11-26 02:37:43,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:43,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:43,963 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-26 02:37:43,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254024663] [2019-11-26 02:37:43,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:43,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:37:43,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252975993] [2019-11-26 02:37:43,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:37:43,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:43,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:37:43,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:43,965 INFO L87 Difference]: Start difference. First operand 383 states and 625 transitions. Second operand 4 states. [2019-11-26 02:37:44,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:44,344 INFO L93 Difference]: Finished difference Result 834 states and 1357 transitions. [2019-11-26 02:37:44,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:44,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-11-26 02:37:44,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:44,347 INFO L225 Difference]: With dead ends: 834 [2019-11-26 02:37:44,347 INFO L226 Difference]: Without dead ends: 463 [2019-11-26 02:37:44,348 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-11-26 02:37:44,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-11-26 02:37:44,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 419. [2019-11-26 02:37:44,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-11-26 02:37:44,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 688 transitions. [2019-11-26 02:37:44,363 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 688 transitions. Word has length 116 [2019-11-26 02:37:44,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:44,363 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 688 transitions. [2019-11-26 02:37:44,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:37:44,363 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 688 transitions. [2019-11-26 02:37:44,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-26 02:37:44,364 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:44,365 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-11-26 02:37:44,365 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:44,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:44,365 INFO L82 PathProgramCache]: Analyzing trace with hash 558195859, now seen corresponding path program 1 times [2019-11-26 02:37:44,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:44,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1490014138] [2019-11-26 02:37:44,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:44,457 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-26 02:37:44,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1490014138] [2019-11-26 02:37:44,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:44,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:37:44,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916892110] [2019-11-26 02:37:44,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:37:44,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:44,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:37:44,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:37:44,459 INFO L87 Difference]: Start difference. First operand 419 states and 688 transitions. Second operand 5 states. [2019-11-26 02:37:45,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:45,009 INFO L93 Difference]: Finished difference Result 890 states and 1448 transitions. [2019-11-26 02:37:45,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:45,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2019-11-26 02:37:45,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:45,013 INFO L225 Difference]: With dead ends: 890 [2019-11-26 02:37:45,013 INFO L226 Difference]: Without dead ends: 483 [2019-11-26 02:37:45,013 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:37:45,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-11-26 02:37:45,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 383. [2019-11-26 02:37:45,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-11-26 02:37:45,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 623 transitions. [2019-11-26 02:37:45,027 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 623 transitions. Word has length 116 [2019-11-26 02:37:45,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:45,027 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 623 transitions. [2019-11-26 02:37:45,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:37:45,028 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 623 transitions. [2019-11-26 02:37:45,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-26 02:37:45,029 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:45,029 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 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] [2019-11-26 02:37:45,029 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:45,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:45,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1612060171, now seen corresponding path program 1 times [2019-11-26 02:37:45,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:45,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437223494] [2019-11-26 02:37:45,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:45,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:45,101 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-26 02:37:45,101 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437223494] [2019-11-26 02:37:45,101 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:45,101 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:37:45,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767352912] [2019-11-26 02:37:45,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:37:45,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:45,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:37:45,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:45,103 INFO L87 Difference]: Start difference. First operand 383 states and 623 transitions. Second operand 4 states. [2019-11-26 02:37:45,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:45,427 INFO L93 Difference]: Finished difference Result 834 states and 1352 transitions. [2019-11-26 02:37:45,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:45,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-11-26 02:37:45,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:45,429 INFO L225 Difference]: With dead ends: 834 [2019-11-26 02:37:45,429 INFO L226 Difference]: Without dead ends: 463 [2019-11-26 02:37:45,430 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-11-26 02:37:45,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-11-26 02:37:45,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 424. [2019-11-26 02:37:45,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-11-26 02:37:45,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 693 transitions. [2019-11-26 02:37:45,445 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 693 transitions. Word has length 121 [2019-11-26 02:37:45,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:45,446 INFO L462 AbstractCegarLoop]: Abstraction has 424 states and 693 transitions. [2019-11-26 02:37:45,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:37:45,446 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 693 transitions. [2019-11-26 02:37:45,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-26 02:37:45,447 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:45,447 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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] [2019-11-26 02:37:45,448 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:45,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:45,448 INFO L82 PathProgramCache]: Analyzing trace with hash 343530046, now seen corresponding path program 1 times [2019-11-26 02:37:45,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:45,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567150594] [2019-11-26 02:37:45,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:45,577 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-26 02:37:45,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567150594] [2019-11-26 02:37:45,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:45,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:37:45,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120589704] [2019-11-26 02:37:45,581 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:37:45,581 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:45,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:37:45,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:37:45,582 INFO L87 Difference]: Start difference. First operand 424 states and 693 transitions. Second operand 5 states. [2019-11-26 02:37:46,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:46,043 INFO L93 Difference]: Finished difference Result 938 states and 1523 transitions. [2019-11-26 02:37:46,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:46,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 121 [2019-11-26 02:37:46,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:46,049 INFO L225 Difference]: With dead ends: 938 [2019-11-26 02:37:46,049 INFO L226 Difference]: Without dead ends: 526 [2019-11-26 02:37:46,049 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:37:46,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2019-11-26 02:37:46,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 424. [2019-11-26 02:37:46,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-11-26 02:37:46,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 693 transitions. [2019-11-26 02:37:46,065 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 693 transitions. Word has length 121 [2019-11-26 02:37:46,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:46,066 INFO L462 AbstractCegarLoop]: Abstraction has 424 states and 693 transitions. [2019-11-26 02:37:46,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:37:46,066 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 693 transitions. [2019-11-26 02:37:46,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-26 02:37:46,067 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:46,067 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 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] [2019-11-26 02:37:46,068 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:46,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:46,068 INFO L82 PathProgramCache]: Analyzing trace with hash 808421377, now seen corresponding path program 1 times [2019-11-26 02:37:46,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:46,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359158343] [2019-11-26 02:37:46,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:46,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:46,121 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-26 02:37:46,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359158343] [2019-11-26 02:37:46,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:46,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:37:46,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760662278] [2019-11-26 02:37:46,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:37:46,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:46,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:37:46,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:46,123 INFO L87 Difference]: Start difference. First operand 424 states and 693 transitions. Second operand 4 states. [2019-11-26 02:37:46,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:46,493 INFO L93 Difference]: Finished difference Result 916 states and 1491 transitions. [2019-11-26 02:37:46,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:46,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-11-26 02:37:46,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:46,496 INFO L225 Difference]: With dead ends: 916 [2019-11-26 02:37:46,496 INFO L226 Difference]: Without dead ends: 504 [2019-11-26 02:37:46,497 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-11-26 02:37:46,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2019-11-26 02:37:46,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 438. [2019-11-26 02:37:46,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2019-11-26 02:37:46,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 714 transitions. [2019-11-26 02:37:46,513 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 714 transitions. Word has length 122 [2019-11-26 02:37:46,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:46,514 INFO L462 AbstractCegarLoop]: Abstraction has 438 states and 714 transitions. [2019-11-26 02:37:46,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:37:46,514 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 714 transitions. [2019-11-26 02:37:46,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-26 02:37:46,515 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:46,515 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 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] [2019-11-26 02:37:46,515 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:46,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:46,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1071264735, now seen corresponding path program 1 times [2019-11-26 02:37:46,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:46,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030807415] [2019-11-26 02:37:46,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:46,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:46,583 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-11-26 02:37:46,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030807415] [2019-11-26 02:37:46,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:37:46,584 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:37:46,584 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554588474] [2019-11-26 02:37:46,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:37:46,585 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:37:46,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:37:46,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:37:46,585 INFO L87 Difference]: Start difference. First operand 438 states and 714 transitions. Second operand 4 states. [2019-11-26 02:37:46,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:37:46,956 INFO L93 Difference]: Finished difference Result 928 states and 1509 transitions. [2019-11-26 02:37:46,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:37:46,956 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 122 [2019-11-26 02:37:46,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:37:46,959 INFO L225 Difference]: With dead ends: 928 [2019-11-26 02:37:46,959 INFO L226 Difference]: Without dead ends: 500 [2019-11-26 02:37:46,960 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-11-26 02:37:46,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2019-11-26 02:37:46,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 464. [2019-11-26 02:37:46,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2019-11-26 02:37:46,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 760 transitions. [2019-11-26 02:37:46,977 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 760 transitions. Word has length 122 [2019-11-26 02:37:46,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:37:46,977 INFO L462 AbstractCegarLoop]: Abstraction has 464 states and 760 transitions. [2019-11-26 02:37:46,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:37:46,978 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 760 transitions. [2019-11-26 02:37:46,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-26 02:37:46,979 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:37:46,979 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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] [2019-11-26 02:37:46,979 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:37:46,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:37:46,980 INFO L82 PathProgramCache]: Analyzing trace with hash 138693166, now seen corresponding path program 1 times [2019-11-26 02:37:46,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:37:46,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241544989] [2019-11-26 02:37:46,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:37:47,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:47,064 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 100 proven. 17 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-26 02:37:47,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241544989] [2019-11-26 02:37:47,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242040813] [2019-11-26 02:37:47,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_68706f7d-f345-4e4b-9847-f04102398d2a/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-11-26 02:37:47,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:37:47,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 02:37:47,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:37:47,370 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2019-11-26 02:37:47,378 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:37:47,381 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:37:47,381 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:37:47,382 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-26 02:37:47,398 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_317|, |v_#memory_$Pointer$.base_317|], 5=[|v_#memory_int_317|]} [2019-11-26 02:37:47,400 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 69 [2019-11-26 02:37:47,401 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:37:47,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:37:47,408 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 51 [2019-11-26 02:37:47,409 INFO L496 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-26 02:37:47,412 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:37:47,456 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:37:47,456 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 100 treesize of output 141 [2019-11-26 02:37:47,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:37:47,458 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:37:47,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:37:47,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:37:47,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:37:47,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:37:47,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:37:47,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:37:47,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:37:47,681 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:37:47,682 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: This case should habe been handled by DER at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:192) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.(DerPreprocessor.java:95) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:291) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:256) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:246) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:440) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:201) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:291) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:177) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:297) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:180) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:463) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:419) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:368) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:333) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:171) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-26 02:37:47,685 INFO L168 Benchmark]: Toolchain (without parser) took 25684.86 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 519.6 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -171.7 MB). Peak memory consumption was 347.8 MB. Max. memory is 11.5 GB. [2019-11-26 02:37:47,685 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:37:47,685 INFO L168 Benchmark]: CACSL2BoogieTranslator took 730.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -146.5 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:37:47,686 INFO L168 Benchmark]: Boogie Procedure Inliner took 113.50 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:37:47,686 INFO L168 Benchmark]: Boogie Preprocessor took 73.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-26 02:37:47,686 INFO L168 Benchmark]: RCFGBuilder took 1907.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 896.6 MB in the end (delta: 175.4 MB). Peak memory consumption was 175.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:37:47,687 INFO L168 Benchmark]: TraceAbstraction took 22856.24 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 401.6 MB). Free memory was 896.6 MB in the beginning and 1.1 GB in the end (delta: -214.4 MB). Peak memory consumption was 187.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:37:47,688 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 730.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -146.5 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 113.50 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 73.62 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1907.20 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 896.6 MB in the end (delta: 175.4 MB). Peak memory consumption was 175.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22856.24 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 401.6 MB). Free memory was 896.6 MB in the beginning and 1.1 GB in the end (delta: -214.4 MB). Peak memory consumption was 187.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: This case should habe been handled by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: This case should habe been handled by DER: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.DerPreprocessor.classify(DerPreprocessor.java:212) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-6b5699a [2019-11-26 02:37:49,583 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:37:49,584 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:37:49,599 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:37:49,600 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:37:49,601 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:37:49,603 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:37:49,610 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:37:49,611 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:37:49,612 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:37:49,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:37:49,615 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:37:49,616 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:37:49,619 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:37:49,620 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:37:49,622 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:37:49,623 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:37:49,625 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:37:49,631 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:37:49,633 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:37:49,637 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:37:49,640 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:37:49,641 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:37:49,643 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:37:49,646 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:37:49,648 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:37:49,649 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:37:49,649 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:37:49,650 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:37:49,651 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:37:49,652 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:37:49,653 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:37:49,654 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:37:49,655 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:37:49,655 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:37:49,656 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:37:49,657 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:37:49,658 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:37:49,658 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:37:49,659 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:37:49,660 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:37:49,662 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_68706f7d-f345-4e4b-9847-f04102398d2a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-11-26 02:37:49,684 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:37:49,684 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:37:49,685 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:37:49,685 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:37:49,686 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:37:49,686 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:37:49,686 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:37:49,686 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:37:49,687 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:37:49,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:37:49,688 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:37:49,689 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:37:49,689 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:37:49,689 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:37:49,689 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:37:49,690 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:37:49,690 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 02:37:49,690 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-26 02:37:49,690 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-26 02:37:49,691 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:37:49,691 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:37:49,691 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 02:37:49,691 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:37:49,692 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:37:49,692 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 02:37:49,692 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:37:49,693 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:37:49,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:37:49,693 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:37:49,693 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:37:49,694 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:37:49,694 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-11-26 02:37:49,694 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-26 02:37:49,695 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:37:49,695 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:37:49,695 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_68706f7d-f345-4e4b-9847-f04102398d2a/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 -> 221d8ee995a69c986b355f515c858471b19e54a2 [2019-11-26 02:37:49,941 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:37:49,955 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:37:49,958 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:37:49,959 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:37:49,959 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:37:49,960 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_68706f7d-f345-4e4b-9847-f04102398d2a/bin/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-1.c [2019-11-26 02:37:50,017 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_68706f7d-f345-4e4b-9847-f04102398d2a/bin/utaipan/data/55a680d38/f66048dda5ad48b09ed61987a9ef0855/FLAGd819e5ea9 [2019-11-26 02:37:50,588 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:37:50,589 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_68706f7d-f345-4e4b-9847-f04102398d2a/sv-benchmarks/c/ssh/s3_srvr.blast.15.i.cil-1.c [2019-11-26 02:37:50,620 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_68706f7d-f345-4e4b-9847-f04102398d2a/bin/utaipan/data/55a680d38/f66048dda5ad48b09ed61987a9ef0855/FLAGd819e5ea9 [2019-11-26 02:37:50,993 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_68706f7d-f345-4e4b-9847-f04102398d2a/bin/utaipan/data/55a680d38/f66048dda5ad48b09ed61987a9ef0855 [2019-11-26 02:37:50,995 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:37:50,997 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:37:50,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:37:50,998 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:37:51,001 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:37:51,001 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:37:50" (1/1) ... [2019-11-26 02:37:51,004 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@246d7800 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:37:51, skipping insertion in model container [2019-11-26 02:37:51,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:37:50" (1/1) ... [2019-11-26 02:37:51,011 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:37:51,075 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:37:51,458 INFO L965 CHandler]: Found a cast between two array/pointer types where the value type is smaller than the cast-to type, and where that value type is smaller than our current memory model resolution [2019-11-26 02:37:51,458 INFO L968 CHandler]: at location: C: (SSL_METHOD *)((void *)0) [1038] [2019-11-26 02:37:51,458 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-26 02:37:51,503 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator has thrown an exception: java.lang.UnsupportedOperationException: Unsupported type(() : VOID) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.computeSize(TypeSizeAndOffsetComputer.java:205) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.constructBytesizeExpression(TypeSizeAndOffsetComputer.java:121) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:955) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:279) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:700) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:282) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1300) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:220) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:993) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:993) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:232) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.FunctionHandler.handleFunctionDefinition(FunctionHandler.java:372) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:1371) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:155) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.processTUchild(CHandler.java:3448) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:2263) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.CHandler.visit(CHandler.java:573) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.PRDispatcher.dispatch(PRDispatcher.java:134) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.translate(MainTranslator.java:193) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.run(MainTranslator.java:115) at de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.MainTranslator.(MainTranslator.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver.finish(CACSL2BoogieTranslatorObserver.java:125) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-11-26 02:37:51,522 INFO L168 Benchmark]: Toolchain (without parser) took 524.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 949.7 MB in the beginning and 1.2 GB in the end (delta: -204.6 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:37:51,523 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:37:51,524 INFO L168 Benchmark]: CACSL2BoogieTranslator took 522.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 949.7 MB in the beginning and 1.2 GB in the end (delta: -204.6 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:37:51,525 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 522.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.2 MB). Free memory was 949.7 MB in the beginning and 1.2 GB in the end (delta: -204.6 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - ExceptionOrErrorResult: UnsupportedOperationException: Unsupported type(() : VOID) de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: UnsupportedOperationException: Unsupported type(() : VOID): de.uni_freiburg.informatik.ultimate.cdt.translation.implementation.base.chandler.TypeSizeAndOffsetComputer.computeSize(TypeSizeAndOffsetComputer.java:205) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...