./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.10.i.cil-2.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_e56a8f3b-2632-48dc-a03d-0b9fc8e56da1/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e56a8f3b-2632-48dc-a03d-0b9fc8e56da1/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e56a8f3b-2632-48dc-a03d-0b9fc8e56da1/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e56a8f3b-2632-48dc-a03d-0b9fc8e56da1/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.10.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e56a8f3b-2632-48dc-a03d-0b9fc8e56da1/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e56a8f3b-2632-48dc-a03d-0b9fc8e56da1/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 24241c008259f315336df16b66c76f690577877c ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_e56a8f3b-2632-48dc-a03d-0b9fc8e56da1/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_e56a8f3b-2632-48dc-a03d-0b9fc8e56da1/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_e56a8f3b-2632-48dc-a03d-0b9fc8e56da1/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_e56a8f3b-2632-48dc-a03d-0b9fc8e56da1/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.10.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_e56a8f3b-2632-48dc-a03d-0b9fc8e56da1/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_e56a8f3b-2632-48dc-a03d-0b9fc8e56da1/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 24241c008259f315336df16b66c76f690577877c .................................................................................................................................................................. 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:17:05,887 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:17:05,888 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:17:05,898 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:17:05,899 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:17:05,900 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:17:05,901 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:17:05,903 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:17:05,905 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:17:05,906 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:17:05,907 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:17:05,908 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:17:05,909 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:17:05,910 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:17:05,910 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:17:05,912 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:17:05,912 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:17:05,913 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:17:05,915 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:17:05,917 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:17:05,918 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:17:05,920 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:17:05,921 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:17:05,921 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:17:05,924 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:17:05,924 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:17:05,925 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:17:05,925 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:17:05,926 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:17:05,927 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:17:05,927 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:17:05,928 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:17:05,928 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:17:05,929 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:17:05,930 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:17:05,930 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:17:05,931 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:17:05,931 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:17:05,931 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:17:05,932 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:17:05,933 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:17:05,933 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e56a8f3b-2632-48dc-a03d-0b9fc8e56da1/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:17:05,946 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:17:05,947 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:17:05,947 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:17:05,947 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:17:05,948 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:17:05,948 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:17:05,948 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:17:05,948 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:17:05,949 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:17:05,949 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:17:05,949 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:17:05,949 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:17:05,949 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:17:05,950 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:17:05,950 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:17:05,950 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:17:05,951 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:17:05,951 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:17:05,951 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:17:05,951 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:17:05,951 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:17:05,952 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:17:05,952 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:17:05,952 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:17:05,952 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:17:05,953 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:17:05,953 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:17:05,953 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:17:05,953 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:17:05,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:17:05,954 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:17:05,954 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:17:05,954 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:17:05,954 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:17:05,955 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:17:05,955 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:17:05,955 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:17:05,955 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_e56a8f3b-2632-48dc-a03d-0b9fc8e56da1/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 -> 24241c008259f315336df16b66c76f690577877c [2019-11-26 02:17:06,089 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:17:06,098 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:17:06,101 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:17:06,102 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:17:06,102 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:17:06,103 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e56a8f3b-2632-48dc-a03d-0b9fc8e56da1/bin/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.10.i.cil-2.c [2019-11-26 02:17:06,158 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e56a8f3b-2632-48dc-a03d-0b9fc8e56da1/bin/utaipan/data/fc01d5f96/bac8a3cbde534a5692251b3ab6c04d5c/FLAG33feaade6 [2019-11-26 02:17:06,720 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:17:06,721 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e56a8f3b-2632-48dc-a03d-0b9fc8e56da1/sv-benchmarks/c/ssh/s3_srvr.blast.10.i.cil-2.c [2019-11-26 02:17:06,761 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e56a8f3b-2632-48dc-a03d-0b9fc8e56da1/bin/utaipan/data/fc01d5f96/bac8a3cbde534a5692251b3ab6c04d5c/FLAG33feaade6 [2019-11-26 02:17:06,944 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e56a8f3b-2632-48dc-a03d-0b9fc8e56da1/bin/utaipan/data/fc01d5f96/bac8a3cbde534a5692251b3ab6c04d5c [2019-11-26 02:17:06,947 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:17:06,948 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:17:06,949 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:17:06,949 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:17:06,952 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:17:06,954 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:17:06" (1/1) ... [2019-11-26 02:17:06,956 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e45dcf3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:06, skipping insertion in model container [2019-11-26 02:17:06,957 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:17:06" (1/1) ... [2019-11-26 02:17:06,963 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:17:07,036 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:17:07,569 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:17:07,581 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:17:07,683 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:17:07,712 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:17:07,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:07 WrapperNode [2019-11-26 02:17:07,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:17:07,714 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:17:07,714 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:17:07,714 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:17:07,722 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:17:07" (1/1) ... [2019-11-26 02:17:07,752 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:17:07" (1/1) ... [2019-11-26 02:17:07,817 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:17:07,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:17:07,818 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:17:07,818 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:17:07,826 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:07" (1/1) ... [2019-11-26 02:17:07,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:07" (1/1) ... [2019-11-26 02:17:07,847 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:07" (1/1) ... [2019-11-26 02:17:07,848 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:07" (1/1) ... [2019-11-26 02:17:07,910 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:07" (1/1) ... [2019-11-26 02:17:07,931 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:07" (1/1) ... [2019-11-26 02:17:07,934 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:07" (1/1) ... [2019-11-26 02:17:07,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:17:07,947 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:17:07,948 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:17:07,948 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:17:07,949 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e56a8f3b-2632-48dc-a03d-0b9fc8e56da1/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:17:08,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-26 02:17:08,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-26 02:17:08,006 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 02:17:08,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-26 02:17:08,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-26 02:17:08,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-26 02:17:08,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-26 02:17:08,007 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 02:17:08,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:17:08,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:17:08,222 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 02:17:09,011 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-26 02:17:09,012 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-26 02:17:09,702 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:17:09,702 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:17:09,703 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:17:09 BoogieIcfgContainer [2019-11-26 02:17:09,703 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:17:09,704 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:17:09,705 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:17:09,707 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:17:09,707 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:17:06" (1/3) ... [2019-11-26 02:17:09,708 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ed5682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:17:09, skipping insertion in model container [2019-11-26 02:17:09,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:07" (2/3) ... [2019-11-26 02:17:09,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40ed5682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:17:09, skipping insertion in model container [2019-11-26 02:17:09,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:17:09" (3/3) ... [2019-11-26 02:17:09,710 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.10.i.cil-2.c [2019-11-26 02:17:09,719 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:17:09,725 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:17:09,735 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:17:09,756 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:17:09,757 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:17:09,757 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:17:09,757 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:17:09,757 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:17:09,757 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:17:09,758 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:17:09,758 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:17:09,782 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2019-11-26 02:17:09,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-26 02:17:09,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:09,790 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] [2019-11-26 02:17:09,790 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:09,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:09,796 INFO L82 PathProgramCache]: Analyzing trace with hash 847224375, now seen corresponding path program 1 times [2019-11-26 02:17:09,804 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:09,805 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927272340] [2019-11-26 02:17:09,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:10,155 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:17:10,156 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927272340] [2019-11-26 02:17:10,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:10,157 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:17:10,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711085985] [2019-11-26 02:17:10,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:10,162 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:10,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:10,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:10,178 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 4 states. [2019-11-26 02:17:10,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:10,641 INFO L93 Difference]: Finished difference Result 239 states and 412 transitions. [2019-11-26 02:17:10,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:10,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-26 02:17:10,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:10,657 INFO L225 Difference]: With dead ends: 239 [2019-11-26 02:17:10,658 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:17:10,662 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:17:10,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:17:10,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-26 02:17:10,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:17:10,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 175 transitions. [2019-11-26 02:17:10,725 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 175 transitions. Word has length 35 [2019-11-26 02:17:10,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:10,725 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 175 transitions. [2019-11-26 02:17:10,726 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:10,726 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 175 transitions. [2019-11-26 02:17:10,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-26 02:17:10,730 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:10,730 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] [2019-11-26 02:17:10,731 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:10,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:10,731 INFO L82 PathProgramCache]: Analyzing trace with hash -333117758, now seen corresponding path program 1 times [2019-11-26 02:17:10,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:10,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254866992] [2019-11-26 02:17:10,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:10,881 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:17:10,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254866992] [2019-11-26 02:17:10,882 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:10,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:17:10,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863393070] [2019-11-26 02:17:10,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:10,883 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:10,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:10,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:10,884 INFO L87 Difference]: Start difference. First operand 115 states and 175 transitions. Second operand 4 states. [2019-11-26 02:17:11,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:11,217 INFO L93 Difference]: Finished difference Result 230 states and 344 transitions. [2019-11-26 02:17:11,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:11,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2019-11-26 02:17:11,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:11,220 INFO L225 Difference]: With dead ends: 230 [2019-11-26 02:17:11,220 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:17:11,221 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:17:11,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:17:11,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-26 02:17:11,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:17:11,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 174 transitions. [2019-11-26 02:17:11,231 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 174 transitions. Word has length 45 [2019-11-26 02:17:11,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:11,231 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 174 transitions. [2019-11-26 02:17:11,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:11,232 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 174 transitions. [2019-11-26 02:17:11,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-26 02:17:11,234 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:11,234 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] [2019-11-26 02:17:11,234 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:11,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:11,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1624813038, now seen corresponding path program 1 times [2019-11-26 02:17:11,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:11,235 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302248745] [2019-11-26 02:17:11,235 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:11,301 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:17:11,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302248745] [2019-11-26 02:17:11,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:11,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:17:11,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766772801] [2019-11-26 02:17:11,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:11,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:11,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:11,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:11,304 INFO L87 Difference]: Start difference. First operand 115 states and 174 transitions. Second operand 4 states. [2019-11-26 02:17:11,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:11,621 INFO L93 Difference]: Finished difference Result 230 states and 343 transitions. [2019-11-26 02:17:11,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:11,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-11-26 02:17:11,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:11,623 INFO L225 Difference]: With dead ends: 230 [2019-11-26 02:17:11,623 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:17:11,624 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:17:11,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:17:11,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-26 02:17:11,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:17:11,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 173 transitions. [2019-11-26 02:17:11,635 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 173 transitions. Word has length 46 [2019-11-26 02:17:11,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:11,636 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 173 transitions. [2019-11-26 02:17:11,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:11,636 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 173 transitions. [2019-11-26 02:17:11,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-26 02:17:11,637 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:11,638 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] [2019-11-26 02:17:11,638 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:11,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:11,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1151446173, now seen corresponding path program 1 times [2019-11-26 02:17:11,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:11,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931056885] [2019-11-26 02:17:11,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:11,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:11,702 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:17:11,702 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931056885] [2019-11-26 02:17:11,702 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:11,703 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:17:11,703 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403169788] [2019-11-26 02:17:11,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:11,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:11,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:11,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:11,704 INFO L87 Difference]: Start difference. First operand 115 states and 173 transitions. Second operand 4 states. [2019-11-26 02:17:11,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:11,949 INFO L93 Difference]: Finished difference Result 230 states and 342 transitions. [2019-11-26 02:17:11,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:11,950 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-26 02:17:11,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:11,951 INFO L225 Difference]: With dead ends: 230 [2019-11-26 02:17:11,951 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:17:11,952 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:17:11,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:17:11,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-26 02:17:11,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:17:11,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2019-11-26 02:17:11,963 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 47 [2019-11-26 02:17:11,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:11,963 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2019-11-26 02:17:11,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:11,964 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2019-11-26 02:17:11,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-26 02:17:11,971 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:11,971 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] [2019-11-26 02:17:11,972 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:11,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:11,972 INFO L82 PathProgramCache]: Analyzing trace with hash 964722340, now seen corresponding path program 1 times [2019-11-26 02:17:11,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:11,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684201448] [2019-11-26 02:17:11,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:12,065 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:17:12,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684201448] [2019-11-26 02:17:12,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:12,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:17:12,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96411676] [2019-11-26 02:17:12,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:12,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:12,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:12,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:12,067 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand 4 states. [2019-11-26 02:17:12,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:12,361 INFO L93 Difference]: Finished difference Result 230 states and 341 transitions. [2019-11-26 02:17:12,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:12,362 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-26 02:17:12,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:12,363 INFO L225 Difference]: With dead ends: 230 [2019-11-26 02:17:12,363 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:17:12,364 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:17:12,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:17:12,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-26 02:17:12,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:17:12,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 171 transitions. [2019-11-26 02:17:12,381 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 171 transitions. Word has length 47 [2019-11-26 02:17:12,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:12,385 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 171 transitions. [2019-11-26 02:17:12,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:12,386 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 171 transitions. [2019-11-26 02:17:12,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-26 02:17:12,386 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:12,386 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] [2019-11-26 02:17:12,387 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:12,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:12,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1078759713, now seen corresponding path program 1 times [2019-11-26 02:17:12,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:12,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322577909] [2019-11-26 02:17:12,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:12,436 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:17:12,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322577909] [2019-11-26 02:17:12,437 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:12,437 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:17:12,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241862697] [2019-11-26 02:17:12,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:12,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:12,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:12,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:12,438 INFO L87 Difference]: Start difference. First operand 115 states and 171 transitions. Second operand 4 states. [2019-11-26 02:17:12,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:12,721 INFO L93 Difference]: Finished difference Result 230 states and 340 transitions. [2019-11-26 02:17:12,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:12,725 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-26 02:17:12,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:12,726 INFO L225 Difference]: With dead ends: 230 [2019-11-26 02:17:12,726 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:17:12,726 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:17:12,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:17:12,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-26 02:17:12,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:17:12,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 170 transitions. [2019-11-26 02:17:12,735 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 170 transitions. Word has length 47 [2019-11-26 02:17:12,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:12,735 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 170 transitions. [2019-11-26 02:17:12,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:12,735 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 170 transitions. [2019-11-26 02:17:12,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-26 02:17:12,736 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:12,736 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] [2019-11-26 02:17:12,736 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:12,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:12,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1936502029, now seen corresponding path program 1 times [2019-11-26 02:17:12,737 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:12,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994653658] [2019-11-26 02:17:12,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:12,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:12,784 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:17:12,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994653658] [2019-11-26 02:17:12,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:12,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:17:12,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037185758] [2019-11-26 02:17:12,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:12,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:12,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:12,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:12,786 INFO L87 Difference]: Start difference. First operand 115 states and 170 transitions. Second operand 4 states. [2019-11-26 02:17:13,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:13,058 INFO L93 Difference]: Finished difference Result 230 states and 339 transitions. [2019-11-26 02:17:13,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:13,059 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-26 02:17:13,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:13,060 INFO L225 Difference]: With dead ends: 230 [2019-11-26 02:17:13,060 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:17:13,061 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:17:13,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:17:13,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-26 02:17:13,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:17:13,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 169 transitions. [2019-11-26 02:17:13,075 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 169 transitions. Word has length 48 [2019-11-26 02:17:13,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:13,075 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 169 transitions. [2019-11-26 02:17:13,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:13,075 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 169 transitions. [2019-11-26 02:17:13,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-26 02:17:13,076 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:13,076 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] [2019-11-26 02:17:13,076 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:13,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:13,077 INFO L82 PathProgramCache]: Analyzing trace with hash -939073863, now seen corresponding path program 1 times [2019-11-26 02:17:13,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:13,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467701164] [2019-11-26 02:17:13,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:13,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:13,151 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:17:13,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467701164] [2019-11-26 02:17:13,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:13,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:17:13,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535913900] [2019-11-26 02:17:13,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:13,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:13,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:13,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:13,153 INFO L87 Difference]: Start difference. First operand 115 states and 169 transitions. Second operand 4 states. [2019-11-26 02:17:13,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:13,387 INFO L93 Difference]: Finished difference Result 228 states and 336 transitions. [2019-11-26 02:17:13,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:13,388 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-26 02:17:13,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:13,389 INFO L225 Difference]: With dead ends: 228 [2019-11-26 02:17:13,389 INFO L226 Difference]: Without dead ends: 125 [2019-11-26 02:17:13,389 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:17:13,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-26 02:17:13,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 115. [2019-11-26 02:17:13,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:17:13,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2019-11-26 02:17:13,395 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 48 [2019-11-26 02:17:13,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:13,395 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2019-11-26 02:17:13,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:13,395 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2019-11-26 02:17:13,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-26 02:17:13,396 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:13,396 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] [2019-11-26 02:17:13,396 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:13,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:13,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1123796024, now seen corresponding path program 1 times [2019-11-26 02:17:13,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:13,397 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335904224] [2019-11-26 02:17:13,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:13,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:13,442 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:17:13,443 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335904224] [2019-11-26 02:17:13,443 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:13,443 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:17:13,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475360701] [2019-11-26 02:17:13,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:13,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:13,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:13,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:13,444 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand 4 states. [2019-11-26 02:17:13,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:13,644 INFO L93 Difference]: Finished difference Result 220 states and 325 transitions. [2019-11-26 02:17:13,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:13,645 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-26 02:17:13,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:13,646 INFO L225 Difference]: With dead ends: 220 [2019-11-26 02:17:13,646 INFO L226 Difference]: Without dead ends: 117 [2019-11-26 02:17:13,646 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:17:13,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-11-26 02:17:13,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-11-26 02:17:13,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:17:13,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 167 transitions. [2019-11-26 02:17:13,650 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 167 transitions. Word has length 49 [2019-11-26 02:17:13,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:13,650 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 167 transitions. [2019-11-26 02:17:13,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:13,650 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 167 transitions. [2019-11-26 02:17:13,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-26 02:17:13,651 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:13,651 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] [2019-11-26 02:17:13,651 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:13,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:13,651 INFO L82 PathProgramCache]: Analyzing trace with hash 648455073, now seen corresponding path program 1 times [2019-11-26 02:17:13,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:13,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737142861] [2019-11-26 02:17:13,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:13,703 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:17:13,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737142861] [2019-11-26 02:17:13,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:13,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:13,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054165928] [2019-11-26 02:17:13,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:13,705 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:13,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:13,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:13,705 INFO L87 Difference]: Start difference. First operand 115 states and 167 transitions. Second operand 4 states. [2019-11-26 02:17:14,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:14,007 INFO L93 Difference]: Finished difference Result 252 states and 373 transitions. [2019-11-26 02:17:14,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:14,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-26 02:17:14,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:14,010 INFO L225 Difference]: With dead ends: 252 [2019-11-26 02:17:14,010 INFO L226 Difference]: Without dead ends: 149 [2019-11-26 02:17:14,011 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:17:14,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-26 02:17:14,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 135. [2019-11-26 02:17:14,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-26 02:17:14,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 201 transitions. [2019-11-26 02:17:14,016 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 201 transitions. Word has length 50 [2019-11-26 02:17:14,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:14,016 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 201 transitions. [2019-11-26 02:17:14,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:14,017 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 201 transitions. [2019-11-26 02:17:14,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-26 02:17:14,017 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:14,018 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] [2019-11-26 02:17:14,018 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:14,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:14,018 INFO L82 PathProgramCache]: Analyzing trace with hash 968609708, now seen corresponding path program 1 times [2019-11-26 02:17:14,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:14,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533708374] [2019-11-26 02:17:14,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:14,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:14,074 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:17:14,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533708374] [2019-11-26 02:17:14,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:14,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:14,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140925739] [2019-11-26 02:17:14,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:14,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:14,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:14,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:14,076 INFO L87 Difference]: Start difference. First operand 135 states and 201 transitions. Second operand 4 states. [2019-11-26 02:17:14,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:14,451 INFO L93 Difference]: Finished difference Result 272 states and 406 transitions. [2019-11-26 02:17:14,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:14,452 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-26 02:17:14,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:14,453 INFO L225 Difference]: With dead ends: 272 [2019-11-26 02:17:14,453 INFO L226 Difference]: Without dead ends: 149 [2019-11-26 02:17:14,454 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:17:14,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-26 02:17:14,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 135. [2019-11-26 02:17:14,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-26 02:17:14,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 200 transitions. [2019-11-26 02:17:14,461 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 200 transitions. Word has length 60 [2019-11-26 02:17:14,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:14,461 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 200 transitions. [2019-11-26 02:17:14,461 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:14,461 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 200 transitions. [2019-11-26 02:17:14,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-26 02:17:14,462 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:14,462 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] [2019-11-26 02:17:14,463 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:14,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:14,463 INFO L82 PathProgramCache]: Analyzing trace with hash 74032744, now seen corresponding path program 1 times [2019-11-26 02:17:14,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:14,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039932547] [2019-11-26 02:17:14,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:14,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:14,563 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:17:14,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039932547] [2019-11-26 02:17:14,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:14,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:17:14,565 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744131554] [2019-11-26 02:17:14,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:17:14,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:14,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:17:14,566 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:14,566 INFO L87 Difference]: Start difference. First operand 135 states and 200 transitions. Second operand 5 states. [2019-11-26 02:17:15,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:15,006 INFO L93 Difference]: Finished difference Result 275 states and 411 transitions. [2019-11-26 02:17:15,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:17:15,007 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-11-26 02:17:15,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:15,009 INFO L225 Difference]: With dead ends: 275 [2019-11-26 02:17:15,009 INFO L226 Difference]: Without dead ends: 152 [2019-11-26 02:17:15,009 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:17:15,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-26 02:17:15,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2019-11-26 02:17:15,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:17:15,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 220 transitions. [2019-11-26 02:17:15,016 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 220 transitions. Word has length 61 [2019-11-26 02:17:15,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:15,016 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 220 transitions. [2019-11-26 02:17:15,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:17:15,016 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 220 transitions. [2019-11-26 02:17:15,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-26 02:17:15,017 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:15,017 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] [2019-11-26 02:17:15,018 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:15,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:15,018 INFO L82 PathProgramCache]: Analyzing trace with hash 2089334030, now seen corresponding path program 1 times [2019-11-26 02:17:15,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:15,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677274318] [2019-11-26 02:17:15,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:15,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:15,102 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:17:15,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677274318] [2019-11-26 02:17:15,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:15,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:15,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418298373] [2019-11-26 02:17:15,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:15,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:15,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:15,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:15,104 INFO L87 Difference]: Start difference. First operand 151 states and 220 transitions. Second operand 4 states. [2019-11-26 02:17:15,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:15,391 INFO L93 Difference]: Finished difference Result 304 states and 443 transitions. [2019-11-26 02:17:15,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:15,392 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-26 02:17:15,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:15,394 INFO L225 Difference]: With dead ends: 304 [2019-11-26 02:17:15,394 INFO L226 Difference]: Without dead ends: 165 [2019-11-26 02:17:15,394 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:17:15,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-26 02:17:15,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 151. [2019-11-26 02:17:15,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:17:15,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 219 transitions. [2019-11-26 02:17:15,400 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 219 transitions. Word has length 62 [2019-11-26 02:17:15,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:15,401 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 219 transitions. [2019-11-26 02:17:15,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:15,401 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 219 transitions. [2019-11-26 02:17:15,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-26 02:17:15,402 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:15,402 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] [2019-11-26 02:17:15,402 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:15,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:15,402 INFO L82 PathProgramCache]: Analyzing trace with hash 45851977, now seen corresponding path program 1 times [2019-11-26 02:17:15,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:15,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311267898] [2019-11-26 02:17:15,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:15,448 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:17:15,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311267898] [2019-11-26 02:17:15,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:15,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:15,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263463218] [2019-11-26 02:17:15,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:15,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:15,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:15,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:15,449 INFO L87 Difference]: Start difference. First operand 151 states and 219 transitions. Second operand 4 states. [2019-11-26 02:17:15,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:15,781 INFO L93 Difference]: Finished difference Result 304 states and 441 transitions. [2019-11-26 02:17:15,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:15,782 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-26 02:17:15,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:15,783 INFO L225 Difference]: With dead ends: 304 [2019-11-26 02:17:15,783 INFO L226 Difference]: Without dead ends: 165 [2019-11-26 02:17:15,784 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:17:15,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-26 02:17:15,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 151. [2019-11-26 02:17:15,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:17:15,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 218 transitions. [2019-11-26 02:17:15,790 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 218 transitions. Word has length 62 [2019-11-26 02:17:15,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:15,790 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 218 transitions. [2019-11-26 02:17:15,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:15,790 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 218 transitions. [2019-11-26 02:17:15,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-26 02:17:15,791 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:15,791 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] [2019-11-26 02:17:15,791 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:15,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:15,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1366443664, now seen corresponding path program 1 times [2019-11-26 02:17:15,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:15,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022433951] [2019-11-26 02:17:15,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:15,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:15,832 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:17:15,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022433951] [2019-11-26 02:17:15,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:15,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:15,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132091412] [2019-11-26 02:17:15,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:15,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:15,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:15,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:15,834 INFO L87 Difference]: Start difference. First operand 151 states and 218 transitions. Second operand 4 states. [2019-11-26 02:17:16,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:16,137 INFO L93 Difference]: Finished difference Result 304 states and 439 transitions. [2019-11-26 02:17:16,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:16,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-26 02:17:16,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:16,140 INFO L225 Difference]: With dead ends: 304 [2019-11-26 02:17:16,140 INFO L226 Difference]: Without dead ends: 165 [2019-11-26 02:17:16,140 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:17:16,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-26 02:17:16,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 151. [2019-11-26 02:17:16,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:17:16,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 217 transitions. [2019-11-26 02:17:16,146 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 217 transitions. Word has length 62 [2019-11-26 02:17:16,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:16,146 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 217 transitions. [2019-11-26 02:17:16,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:16,146 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 217 transitions. [2019-11-26 02:17:16,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-26 02:17:16,147 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:16,147 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] [2019-11-26 02:17:16,147 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:16,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:16,147 INFO L82 PathProgramCache]: Analyzing trace with hash -1823141711, now seen corresponding path program 1 times [2019-11-26 02:17:16,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:16,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80581932] [2019-11-26 02:17:16,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:16,187 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:17:16,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80581932] [2019-11-26 02:17:16,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:16,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:16,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904346582] [2019-11-26 02:17:16,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:16,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:16,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:16,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:16,189 INFO L87 Difference]: Start difference. First operand 151 states and 217 transitions. Second operand 4 states. [2019-11-26 02:17:16,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:16,524 INFO L93 Difference]: Finished difference Result 304 states and 437 transitions. [2019-11-26 02:17:16,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:16,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-26 02:17:16,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:16,526 INFO L225 Difference]: With dead ends: 304 [2019-11-26 02:17:16,526 INFO L226 Difference]: Without dead ends: 165 [2019-11-26 02:17:16,527 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:17:16,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-26 02:17:16,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 151. [2019-11-26 02:17:16,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:17:16,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 216 transitions. [2019-11-26 02:17:16,533 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 216 transitions. Word has length 63 [2019-11-26 02:17:16,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:16,533 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 216 transitions. [2019-11-26 02:17:16,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:16,533 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 216 transitions. [2019-11-26 02:17:16,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-26 02:17:16,535 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:16,536 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] [2019-11-26 02:17:16,536 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:16,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:16,536 INFO L82 PathProgramCache]: Analyzing trace with hash -435849841, now seen corresponding path program 1 times [2019-11-26 02:17:16,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:16,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16367257] [2019-11-26 02:17:16,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:16,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:16,585 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:17:16,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16367257] [2019-11-26 02:17:16,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:16,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:16,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845931424] [2019-11-26 02:17:16,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:16,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:16,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:16,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:16,586 INFO L87 Difference]: Start difference. First operand 151 states and 216 transitions. Second operand 4 states. [2019-11-26 02:17:16,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:16,922 INFO L93 Difference]: Finished difference Result 302 states and 433 transitions. [2019-11-26 02:17:16,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:16,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-11-26 02:17:16,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:16,924 INFO L225 Difference]: With dead ends: 302 [2019-11-26 02:17:16,925 INFO L226 Difference]: Without dead ends: 163 [2019-11-26 02:17:16,925 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:17:16,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-26 02:17:16,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 151. [2019-11-26 02:17:16,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:17:16,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 215 transitions. [2019-11-26 02:17:16,931 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 215 transitions. Word has length 63 [2019-11-26 02:17:16,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:16,931 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 215 transitions. [2019-11-26 02:17:16,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:16,931 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 215 transitions. [2019-11-26 02:17:16,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-26 02:17:16,932 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:16,932 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] [2019-11-26 02:17:16,932 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:16,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:16,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1044395179, now seen corresponding path program 1 times [2019-11-26 02:17:16,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:16,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946919338] [2019-11-26 02:17:16,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:16,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:16,980 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:17:16,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946919338] [2019-11-26 02:17:16,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:16,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:16,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256773442] [2019-11-26 02:17:16,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:16,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:16,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:16,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:16,983 INFO L87 Difference]: Start difference. First operand 151 states and 215 transitions. Second operand 4 states. [2019-11-26 02:17:17,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:17,327 INFO L93 Difference]: Finished difference Result 302 states and 431 transitions. [2019-11-26 02:17:17,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:17,328 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-26 02:17:17,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:17,329 INFO L225 Difference]: With dead ends: 302 [2019-11-26 02:17:17,329 INFO L226 Difference]: Without dead ends: 163 [2019-11-26 02:17:17,330 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:17:17,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-26 02:17:17,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 151. [2019-11-26 02:17:17,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:17:17,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 214 transitions. [2019-11-26 02:17:17,336 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 214 transitions. Word has length 64 [2019-11-26 02:17:17,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:17,336 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 214 transitions. [2019-11-26 02:17:17,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:17,336 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 214 transitions. [2019-11-26 02:17:17,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-26 02:17:17,337 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:17,337 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] [2019-11-26 02:17:17,337 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:17,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:17,338 INFO L82 PathProgramCache]: Analyzing trace with hash -621572362, now seen corresponding path program 1 times [2019-11-26 02:17:17,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:17,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992060081] [2019-11-26 02:17:17,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:17,401 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:17:17,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992060081] [2019-11-26 02:17:17,401 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:17,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:17,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233760439] [2019-11-26 02:17:17,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:17,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:17,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:17,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:17,403 INFO L87 Difference]: Start difference. First operand 151 states and 214 transitions. Second operand 4 states. [2019-11-26 02:17:17,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:17,663 INFO L93 Difference]: Finished difference Result 294 states and 420 transitions. [2019-11-26 02:17:17,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:17,664 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-26 02:17:17,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:17,665 INFO L225 Difference]: With dead ends: 294 [2019-11-26 02:17:17,665 INFO L226 Difference]: Without dead ends: 155 [2019-11-26 02:17:17,665 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:17:17,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-26 02:17:17,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2019-11-26 02:17:17,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:17:17,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 213 transitions. [2019-11-26 02:17:17,671 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 213 transitions. Word has length 65 [2019-11-26 02:17:17,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:17,671 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 213 transitions. [2019-11-26 02:17:17,671 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:17,671 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 213 transitions. [2019-11-26 02:17:17,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-26 02:17:17,672 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:17,672 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] [2019-11-26 02:17:17,672 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:17,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:17,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1914130363, now seen corresponding path program 1 times [2019-11-26 02:17:17,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:17,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880608515] [2019-11-26 02:17:17,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:17,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:17,759 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:17:17,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880608515] [2019-11-26 02:17:17,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:17,760 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:17:17,760 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420231628] [2019-11-26 02:17:17,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:17:17,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:17,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:17:17,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:17:17,761 INFO L87 Difference]: Start difference. First operand 151 states and 213 transitions. Second operand 6 states. [2019-11-26 02:17:18,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:18,367 INFO L93 Difference]: Finished difference Result 384 states and 553 transitions. [2019-11-26 02:17:18,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:17:18,367 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-11-26 02:17:18,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:18,369 INFO L225 Difference]: With dead ends: 384 [2019-11-26 02:17:18,369 INFO L226 Difference]: Without dead ends: 245 [2019-11-26 02:17:18,370 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:17:18,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-11-26 02:17:18,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 188. [2019-11-26 02:17:18,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-26 02:17:18,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 280 transitions. [2019-11-26 02:17:18,377 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 280 transitions. Word has length 68 [2019-11-26 02:17:18,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:18,378 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 280 transitions. [2019-11-26 02:17:18,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:17:18,378 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 280 transitions. [2019-11-26 02:17:18,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-26 02:17:18,379 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:18,379 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] [2019-11-26 02:17:18,379 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:18,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:18,379 INFO L82 PathProgramCache]: Analyzing trace with hash -798033533, now seen corresponding path program 1 times [2019-11-26 02:17:18,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:18,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045267973] [2019-11-26 02:17:18,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:18,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:18,503 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:17:18,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045267973] [2019-11-26 02:17:18,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:18,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:17:18,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074928219] [2019-11-26 02:17:18,505 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:17:18,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:18,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:17:18,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:17:18,505 INFO L87 Difference]: Start difference. First operand 188 states and 280 transitions. Second operand 6 states. [2019-11-26 02:17:19,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:19,147 INFO L93 Difference]: Finished difference Result 416 states and 614 transitions. [2019-11-26 02:17:19,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:17:19,148 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-11-26 02:17:19,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:19,150 INFO L225 Difference]: With dead ends: 416 [2019-11-26 02:17:19,150 INFO L226 Difference]: Without dead ends: 240 [2019-11-26 02:17:19,150 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:17:19,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-11-26 02:17:19,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 189. [2019-11-26 02:17:19,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2019-11-26 02:17:19,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 281 transitions. [2019-11-26 02:17:19,184 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 281 transitions. Word has length 69 [2019-11-26 02:17:19,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:19,184 INFO L462 AbstractCegarLoop]: Abstraction has 189 states and 281 transitions. [2019-11-26 02:17:19,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:17:19,184 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 281 transitions. [2019-11-26 02:17:19,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-26 02:17:19,185 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:19,185 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] [2019-11-26 02:17:19,185 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:19,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:19,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1638271528, now seen corresponding path program 1 times [2019-11-26 02:17:19,186 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:19,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045677997] [2019-11-26 02:17:19,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:19,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:19,265 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:17:19,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045677997] [2019-11-26 02:17:19,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:19,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:19,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842637354] [2019-11-26 02:17:19,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:19,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:19,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:19,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:19,267 INFO L87 Difference]: Start difference. First operand 189 states and 281 transitions. Second operand 4 states. [2019-11-26 02:17:19,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:19,681 INFO L93 Difference]: Finished difference Result 428 states and 644 transitions. [2019-11-26 02:17:19,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:19,683 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-26 02:17:19,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:19,685 INFO L225 Difference]: With dead ends: 428 [2019-11-26 02:17:19,685 INFO L226 Difference]: Without dead ends: 251 [2019-11-26 02:17:19,685 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:17:19,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2019-11-26 02:17:19,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 219. [2019-11-26 02:17:19,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2019-11-26 02:17:19,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 334 transitions. [2019-11-26 02:17:19,694 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 334 transitions. Word has length 80 [2019-11-26 02:17:19,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:19,694 INFO L462 AbstractCegarLoop]: Abstraction has 219 states and 334 transitions. [2019-11-26 02:17:19,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:19,694 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 334 transitions. [2019-11-26 02:17:19,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-26 02:17:19,695 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:19,695 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] [2019-11-26 02:17:19,696 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:19,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:19,696 INFO L82 PathProgramCache]: Analyzing trace with hash -405210525, now seen corresponding path program 1 times [2019-11-26 02:17:19,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:19,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353114757] [2019-11-26 02:17:19,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:19,758 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:17:19,759 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353114757] [2019-11-26 02:17:19,759 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:19,759 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:19,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546924312] [2019-11-26 02:17:19,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:19,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:19,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:19,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:19,760 INFO L87 Difference]: Start difference. First operand 219 states and 334 transitions. Second operand 4 states. [2019-11-26 02:17:20,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:20,242 INFO L93 Difference]: Finished difference Result 516 states and 790 transitions. [2019-11-26 02:17:20,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:20,246 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-11-26 02:17:20,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:20,248 INFO L225 Difference]: With dead ends: 516 [2019-11-26 02:17:20,248 INFO L226 Difference]: Without dead ends: 309 [2019-11-26 02:17:20,249 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:17:20,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2019-11-26 02:17:20,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 256. [2019-11-26 02:17:20,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-26 02:17:20,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 401 transitions. [2019-11-26 02:17:20,263 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 401 transitions. Word has length 80 [2019-11-26 02:17:20,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:20,263 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 401 transitions. [2019-11-26 02:17:20,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:20,264 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 401 transitions. [2019-11-26 02:17:20,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-11-26 02:17:20,265 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:20,265 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] [2019-11-26 02:17:20,265 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:20,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:20,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1817506166, now seen corresponding path program 1 times [2019-11-26 02:17:20,266 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:20,266 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635522787] [2019-11-26 02:17:20,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:20,396 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:17:20,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635522787] [2019-11-26 02:17:20,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:20,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:17:20,397 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643127650] [2019-11-26 02:17:20,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:17:20,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:20,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:17:20,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:20,400 INFO L87 Difference]: Start difference. First operand 256 states and 401 transitions. Second operand 5 states. [2019-11-26 02:17:20,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:20,891 INFO L93 Difference]: Finished difference Result 600 states and 940 transitions. [2019-11-26 02:17:20,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:20,891 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-11-26 02:17:20,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:20,893 INFO L225 Difference]: With dead ends: 600 [2019-11-26 02:17:20,893 INFO L226 Difference]: Without dead ends: 356 [2019-11-26 02:17:20,894 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:17:20,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2019-11-26 02:17:20,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 256. [2019-11-26 02:17:20,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-26 02:17:20,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 401 transitions. [2019-11-26 02:17:20,904 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 401 transitions. Word has length 80 [2019-11-26 02:17:20,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:20,904 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 401 transitions. [2019-11-26 02:17:20,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:17:20,905 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 401 transitions. [2019-11-26 02:17:20,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-26 02:17:20,905 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:20,906 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] [2019-11-26 02:17:20,906 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:20,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:20,907 INFO L82 PathProgramCache]: Analyzing trace with hash 316842971, now seen corresponding path program 1 times [2019-11-26 02:17:20,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:20,907 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864753873] [2019-11-26 02:17:20,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:20,969 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:17:20,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864753873] [2019-11-26 02:17:20,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:20,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:20,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261233331] [2019-11-26 02:17:20,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:20,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:20,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:20,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:20,971 INFO L87 Difference]: Start difference. First operand 256 states and 401 transitions. Second operand 4 states. [2019-11-26 02:17:21,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:21,515 INFO L93 Difference]: Finished difference Result 585 states and 918 transitions. [2019-11-26 02:17:21,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:21,516 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-11-26 02:17:21,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:21,518 INFO L225 Difference]: With dead ends: 585 [2019-11-26 02:17:21,518 INFO L226 Difference]: Without dead ends: 341 [2019-11-26 02:17:21,519 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:17:21,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2019-11-26 02:17:21,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 256. [2019-11-26 02:17:21,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-26 02:17:21,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 401 transitions. [2019-11-26 02:17:21,529 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 401 transitions. Word has length 81 [2019-11-26 02:17:21,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:21,529 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 401 transitions. [2019-11-26 02:17:21,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:21,529 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 401 transitions. [2019-11-26 02:17:21,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-26 02:17:21,530 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:21,531 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] [2019-11-26 02:17:21,531 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:21,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:21,533 INFO L82 PathProgramCache]: Analyzing trace with hash -514648940, now seen corresponding path program 1 times [2019-11-26 02:17:21,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:21,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796164466] [2019-11-26 02:17:21,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:21,616 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:17:21,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796164466] [2019-11-26 02:17:21,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:21,617 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:17:21,617 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627822978] [2019-11-26 02:17:21,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:17:21,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:21,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:17:21,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:21,619 INFO L87 Difference]: Start difference. First operand 256 states and 401 transitions. Second operand 5 states. [2019-11-26 02:17:22,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:22,111 INFO L93 Difference]: Finished difference Result 591 states and 928 transitions. [2019-11-26 02:17:22,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:22,112 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-11-26 02:17:22,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:22,114 INFO L225 Difference]: With dead ends: 591 [2019-11-26 02:17:22,114 INFO L226 Difference]: Without dead ends: 347 [2019-11-26 02:17:22,114 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:17:22,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2019-11-26 02:17:22,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 247. [2019-11-26 02:17:22,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2019-11-26 02:17:22,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 390 transitions. [2019-11-26 02:17:22,125 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 390 transitions. Word has length 81 [2019-11-26 02:17:22,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:22,126 INFO L462 AbstractCegarLoop]: Abstraction has 247 states and 390 transitions. [2019-11-26 02:17:22,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:17:22,126 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 390 transitions. [2019-11-26 02:17:22,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-26 02:17:22,127 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:22,127 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] [2019-11-26 02:17:22,127 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:22,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:22,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1706996653, now seen corresponding path program 1 times [2019-11-26 02:17:22,128 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:22,128 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771711386] [2019-11-26 02:17:22,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:22,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:22,235 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:17:22,235 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771711386] [2019-11-26 02:17:22,235 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:22,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:17:22,236 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591112646] [2019-11-26 02:17:22,236 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:17:22,237 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:22,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:17:22,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:17:22,237 INFO L87 Difference]: Start difference. First operand 247 states and 390 transitions. Second operand 6 states. [2019-11-26 02:17:22,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:22,782 INFO L93 Difference]: Finished difference Result 568 states and 896 transitions. [2019-11-26 02:17:22,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:17:22,782 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-11-26 02:17:22,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:22,819 INFO L225 Difference]: With dead ends: 568 [2019-11-26 02:17:22,819 INFO L226 Difference]: Without dead ends: 333 [2019-11-26 02:17:22,820 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:17:22,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-11-26 02:17:22,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 277. [2019-11-26 02:17:22,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-11-26 02:17:22,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 443 transitions. [2019-11-26 02:17:22,834 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 443 transitions. Word has length 96 [2019-11-26 02:17:22,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:22,835 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 443 transitions. [2019-11-26 02:17:22,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:17:22,835 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 443 transitions. [2019-11-26 02:17:22,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-26 02:17:22,836 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:22,836 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] [2019-11-26 02:17:22,836 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:22,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:22,837 INFO L82 PathProgramCache]: Analyzing trace with hash -278325017, now seen corresponding path program 1 times [2019-11-26 02:17:22,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:22,837 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531478872] [2019-11-26 02:17:22,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:22,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:22,941 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:17:22,941 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531478872] [2019-11-26 02:17:22,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:22,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:17:22,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772349609] [2019-11-26 02:17:22,942 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:17:22,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:22,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:17:22,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:17:22,943 INFO L87 Difference]: Start difference. First operand 277 states and 443 transitions. Second operand 6 states. [2019-11-26 02:17:23,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:23,455 INFO L93 Difference]: Finished difference Result 598 states and 948 transitions. [2019-11-26 02:17:23,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:17:23,457 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 101 [2019-11-26 02:17:23,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:23,459 INFO L225 Difference]: With dead ends: 598 [2019-11-26 02:17:23,459 INFO L226 Difference]: Without dead ends: 333 [2019-11-26 02:17:23,459 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:17:23,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-11-26 02:17:23,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 282. [2019-11-26 02:17:23,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-11-26 02:17:23,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 452 transitions. [2019-11-26 02:17:23,470 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 452 transitions. Word has length 101 [2019-11-26 02:17:23,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:23,471 INFO L462 AbstractCegarLoop]: Abstraction has 282 states and 452 transitions. [2019-11-26 02:17:23,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:17:23,471 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 452 transitions. [2019-11-26 02:17:23,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-26 02:17:23,472 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:23,472 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] [2019-11-26 02:17:23,473 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:23,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:23,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1750570879, now seen corresponding path program 1 times [2019-11-26 02:17:23,474 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:23,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932451134] [2019-11-26 02:17:23,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:23,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:23,572 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:17:23,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932451134] [2019-11-26 02:17:23,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:23,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:17:23,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307716741] [2019-11-26 02:17:23,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:17:23,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:23,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:17:23,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:17:23,574 INFO L87 Difference]: Start difference. First operand 282 states and 452 transitions. Second operand 6 states. [2019-11-26 02:17:24,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:24,117 INFO L93 Difference]: Finished difference Result 601 states and 954 transitions. [2019-11-26 02:17:24,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:17:24,118 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 102 [2019-11-26 02:17:24,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:24,120 INFO L225 Difference]: With dead ends: 601 [2019-11-26 02:17:24,120 INFO L226 Difference]: Without dead ends: 331 [2019-11-26 02:17:24,120 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:17:24,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2019-11-26 02:17:24,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 283. [2019-11-26 02:17:24,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2019-11-26 02:17:24,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 453 transitions. [2019-11-26 02:17:24,133 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 453 transitions. Word has length 102 [2019-11-26 02:17:24,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:24,133 INFO L462 AbstractCegarLoop]: Abstraction has 283 states and 453 transitions. [2019-11-26 02:17:24,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:17:24,133 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 453 transitions. [2019-11-26 02:17:24,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-26 02:17:24,134 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:24,135 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] [2019-11-26 02:17:24,135 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:24,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:24,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1511349026, now seen corresponding path program 1 times [2019-11-26 02:17:24,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:24,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721413336] [2019-11-26 02:17:24,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:24,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:24,231 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:17:24,232 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721413336] [2019-11-26 02:17:24,232 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:24,232 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:17:24,234 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407629184] [2019-11-26 02:17:24,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:17:24,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:24,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:17:24,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:17:24,235 INFO L87 Difference]: Start difference. First operand 283 states and 453 transitions. Second operand 6 states. [2019-11-26 02:17:24,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:24,794 INFO L93 Difference]: Finished difference Result 597 states and 947 transitions. [2019-11-26 02:17:24,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:17:24,794 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 107 [2019-11-26 02:17:24,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:24,796 INFO L225 Difference]: With dead ends: 597 [2019-11-26 02:17:24,796 INFO L226 Difference]: Without dead ends: 326 [2019-11-26 02:17:24,797 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:17:24,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2019-11-26 02:17:24,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 286. [2019-11-26 02:17:24,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-11-26 02:17:24,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 456 transitions. [2019-11-26 02:17:24,809 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 456 transitions. Word has length 107 [2019-11-26 02:17:24,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:24,809 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 456 transitions. [2019-11-26 02:17:24,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:17:24,809 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 456 transitions. [2019-11-26 02:17:24,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-26 02:17:24,811 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:24,811 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] [2019-11-26 02:17:24,811 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:24,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:24,811 INFO L82 PathProgramCache]: Analyzing trace with hash 928430234, now seen corresponding path program 1 times [2019-11-26 02:17:24,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:24,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080010804] [2019-11-26 02:17:24,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:24,897 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:17:24,897 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080010804] [2019-11-26 02:17:24,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:24,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:24,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95761634] [2019-11-26 02:17:24,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:24,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:24,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:24,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:24,899 INFO L87 Difference]: Start difference. First operand 286 states and 456 transitions. Second operand 4 states. [2019-11-26 02:17:25,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:25,285 INFO L93 Difference]: Finished difference Result 596 states and 944 transitions. [2019-11-26 02:17:25,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:25,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-11-26 02:17:25,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:25,287 INFO L225 Difference]: With dead ends: 596 [2019-11-26 02:17:25,287 INFO L226 Difference]: Without dead ends: 322 [2019-11-26 02:17:25,287 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:17:25,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-26 02:17:25,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 286. [2019-11-26 02:17:25,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2019-11-26 02:17:25,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 455 transitions. [2019-11-26 02:17:25,298 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 455 transitions. Word has length 108 [2019-11-26 02:17:25,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:25,298 INFO L462 AbstractCegarLoop]: Abstraction has 286 states and 455 transitions. [2019-11-26 02:17:25,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:25,298 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 455 transitions. [2019-11-26 02:17:25,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-26 02:17:25,300 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:25,300 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] [2019-11-26 02:17:25,300 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:25,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:25,301 INFO L82 PathProgramCache]: Analyzing trace with hash -903130539, now seen corresponding path program 1 times [2019-11-26 02:17:25,301 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:25,301 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27384527] [2019-11-26 02:17:25,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:25,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:25,372 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:17:25,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27384527] [2019-11-26 02:17:25,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:25,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:25,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849044194] [2019-11-26 02:17:25,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:25,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:25,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:25,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:25,375 INFO L87 Difference]: Start difference. First operand 286 states and 455 transitions. Second operand 4 states. [2019-11-26 02:17:25,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:25,844 INFO L93 Difference]: Finished difference Result 642 states and 1021 transitions. [2019-11-26 02:17:25,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:25,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-11-26 02:17:25,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:25,848 INFO L225 Difference]: With dead ends: 642 [2019-11-26 02:17:25,848 INFO L226 Difference]: Without dead ends: 368 [2019-11-26 02:17:25,848 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:17:25,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2019-11-26 02:17:25,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 316. [2019-11-26 02:17:25,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2019-11-26 02:17:25,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 508 transitions. [2019-11-26 02:17:25,862 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 508 transitions. Word has length 108 [2019-11-26 02:17:25,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:25,863 INFO L462 AbstractCegarLoop]: Abstraction has 316 states and 508 transitions. [2019-11-26 02:17:25,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:25,863 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 508 transitions. [2019-11-26 02:17:25,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-26 02:17:25,864 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:25,864 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] [2019-11-26 02:17:25,865 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:25,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:25,865 INFO L82 PathProgramCache]: Analyzing trace with hash -268225028, now seen corresponding path program 1 times [2019-11-26 02:17:25,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:25,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542261693] [2019-11-26 02:17:25,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:25,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:25,978 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:17:25,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542261693] [2019-11-26 02:17:25,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:25,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:17:25,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149366223] [2019-11-26 02:17:25,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:17:25,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:25,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:17:25,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:25,980 INFO L87 Difference]: Start difference. First operand 316 states and 508 transitions. Second operand 5 states. [2019-11-26 02:17:26,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:26,499 INFO L93 Difference]: Finished difference Result 754 states and 1216 transitions. [2019-11-26 02:17:26,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:26,499 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2019-11-26 02:17:26,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:26,502 INFO L225 Difference]: With dead ends: 754 [2019-11-26 02:17:26,502 INFO L226 Difference]: Without dead ends: 450 [2019-11-26 02:17:26,503 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:17:26,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2019-11-26 02:17:26,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 346. [2019-11-26 02:17:26,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-11-26 02:17:26,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 561 transitions. [2019-11-26 02:17:26,520 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 561 transitions. Word has length 108 [2019-11-26 02:17:26,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:26,521 INFO L462 AbstractCegarLoop]: Abstraction has 346 states and 561 transitions. [2019-11-26 02:17:26,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:17:26,521 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 561 transitions. [2019-11-26 02:17:26,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-26 02:17:26,523 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:26,523 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] [2019-11-26 02:17:26,523 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:26,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:26,524 INFO L82 PathProgramCache]: Analyzing trace with hash -1654338393, now seen corresponding path program 1 times [2019-11-26 02:17:26,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:26,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118488139] [2019-11-26 02:17:26,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:26,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:26,658 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:17:26,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118488139] [2019-11-26 02:17:26,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:26,659 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:26,659 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318835113] [2019-11-26 02:17:26,659 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:26,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:26,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:26,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:26,660 INFO L87 Difference]: Start difference. First operand 346 states and 561 transitions. Second operand 4 states. [2019-11-26 02:17:27,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:27,142 INFO L93 Difference]: Finished difference Result 714 states and 1152 transitions. [2019-11-26 02:17:27,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:27,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 109 [2019-11-26 02:17:27,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:27,145 INFO L225 Difference]: With dead ends: 714 [2019-11-26 02:17:27,145 INFO L226 Difference]: Without dead ends: 380 [2019-11-26 02:17:27,145 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:17:27,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-11-26 02:17:27,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 346. [2019-11-26 02:17:27,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2019-11-26 02:17:27,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 560 transitions. [2019-11-26 02:17:27,158 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 560 transitions. Word has length 109 [2019-11-26 02:17:27,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:27,158 INFO L462 AbstractCegarLoop]: Abstraction has 346 states and 560 transitions. [2019-11-26 02:17:27,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:27,159 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 560 transitions. [2019-11-26 02:17:27,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-26 02:17:27,160 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:27,160 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] [2019-11-26 02:17:27,160 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:27,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:27,161 INFO L82 PathProgramCache]: Analyzing trace with hash 719151935, now seen corresponding path program 1 times [2019-11-26 02:17:27,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:27,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548249647] [2019-11-26 02:17:27,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:27,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:27,226 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:17:27,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548249647] [2019-11-26 02:17:27,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:27,227 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:27,227 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866331991] [2019-11-26 02:17:27,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:27,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:27,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:27,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:27,228 INFO L87 Difference]: Start difference. First operand 346 states and 560 transitions. Second operand 4 states. [2019-11-26 02:17:27,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:27,758 INFO L93 Difference]: Finished difference Result 762 states and 1230 transitions. [2019-11-26 02:17:27,759 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:27,759 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-11-26 02:17:27,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:27,761 INFO L225 Difference]: With dead ends: 762 [2019-11-26 02:17:27,762 INFO L226 Difference]: Without dead ends: 428 [2019-11-26 02:17:27,762 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:17:27,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2019-11-26 02:17:27,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 381. [2019-11-26 02:17:27,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-11-26 02:17:27,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 622 transitions. [2019-11-26 02:17:27,777 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 622 transitions. Word has length 113 [2019-11-26 02:17:27,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:27,777 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 622 transitions. [2019-11-26 02:17:27,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:27,777 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 622 transitions. [2019-11-26 02:17:27,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-26 02:17:27,779 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:27,779 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] [2019-11-26 02:17:27,779 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:27,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:27,780 INFO L82 PathProgramCache]: Analyzing trace with hash -1938509832, now seen corresponding path program 1 times [2019-11-26 02:17:27,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:27,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588964911] [2019-11-26 02:17:27,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:27,912 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:17:27,912 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588964911] [2019-11-26 02:17:27,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:27,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:17:27,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301175276] [2019-11-26 02:17:27,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:17:27,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:27,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:17:27,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:27,914 INFO L87 Difference]: Start difference. First operand 381 states and 622 transitions. Second operand 5 states. [2019-11-26 02:17:28,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:28,434 INFO L93 Difference]: Finished difference Result 850 states and 1379 transitions. [2019-11-26 02:17:28,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:28,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2019-11-26 02:17:28,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:28,437 INFO L225 Difference]: With dead ends: 850 [2019-11-26 02:17:28,437 INFO L226 Difference]: Without dead ends: 481 [2019-11-26 02:17:28,438 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:17:28,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 481 states. [2019-11-26 02:17:28,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 481 to 381. [2019-11-26 02:17:28,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-11-26 02:17:28,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 621 transitions. [2019-11-26 02:17:28,454 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 621 transitions. Word has length 113 [2019-11-26 02:17:28,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:28,454 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 621 transitions. [2019-11-26 02:17:28,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:17:28,454 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 621 transitions. [2019-11-26 02:17:28,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-26 02:17:28,455 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:28,456 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] [2019-11-26 02:17:28,456 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:28,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:28,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1687381977, now seen corresponding path program 1 times [2019-11-26 02:17:28,456 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:28,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285307669] [2019-11-26 02:17:28,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:28,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:28,527 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:17:28,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285307669] [2019-11-26 02:17:28,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:28,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:28,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485423528] [2019-11-26 02:17:28,528 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:28,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:28,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:28,529 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:28,529 INFO L87 Difference]: Start difference. First operand 381 states and 621 transitions. Second operand 4 states. [2019-11-26 02:17:29,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:29,006 INFO L93 Difference]: Finished difference Result 830 states and 1349 transitions. [2019-11-26 02:17:29,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:29,007 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-11-26 02:17:29,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:29,010 INFO L225 Difference]: With dead ends: 830 [2019-11-26 02:17:29,010 INFO L226 Difference]: Without dead ends: 461 [2019-11-26 02:17:29,011 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:17:29,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-11-26 02:17:29,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 417. [2019-11-26 02:17:29,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2019-11-26 02:17:29,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 684 transitions. [2019-11-26 02:17:29,028 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 684 transitions. Word has length 114 [2019-11-26 02:17:29,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:29,028 INFO L462 AbstractCegarLoop]: Abstraction has 417 states and 684 transitions. [2019-11-26 02:17:29,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:29,028 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 684 transitions. [2019-11-26 02:17:29,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-26 02:17:29,030 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:29,030 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] [2019-11-26 02:17:29,030 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:29,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:29,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1824449166, now seen corresponding path program 1 times [2019-11-26 02:17:29,031 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:29,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339848298] [2019-11-26 02:17:29,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:29,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:29,131 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:17:29,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339848298] [2019-11-26 02:17:29,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:29,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:17:29,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621401441] [2019-11-26 02:17:29,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:17:29,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:29,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:17:29,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:29,133 INFO L87 Difference]: Start difference. First operand 417 states and 684 transitions. Second operand 5 states. [2019-11-26 02:17:29,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:29,486 INFO L93 Difference]: Finished difference Result 884 states and 1436 transitions. [2019-11-26 02:17:29,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:29,486 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2019-11-26 02:17:29,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:29,489 INFO L225 Difference]: With dead ends: 884 [2019-11-26 02:17:29,489 INFO L226 Difference]: Without dead ends: 479 [2019-11-26 02:17:29,489 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:17:29,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2019-11-26 02:17:29,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 381. [2019-11-26 02:17:29,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2019-11-26 02:17:29,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 619 transitions. [2019-11-26 02:17:29,506 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 619 transitions. Word has length 114 [2019-11-26 02:17:29,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:29,506 INFO L462 AbstractCegarLoop]: Abstraction has 381 states and 619 transitions. [2019-11-26 02:17:29,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:17:29,506 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 619 transitions. [2019-11-26 02:17:29,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-26 02:17:29,507 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:29,508 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] [2019-11-26 02:17:29,508 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:29,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:29,508 INFO L82 PathProgramCache]: Analyzing trace with hash -355564678, now seen corresponding path program 1 times [2019-11-26 02:17:29,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:29,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131226246] [2019-11-26 02:17:29,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:29,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:29,582 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:17:29,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131226246] [2019-11-26 02:17:29,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:29,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:29,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838329658] [2019-11-26 02:17:29,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:29,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:29,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:29,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:29,584 INFO L87 Difference]: Start difference. First operand 381 states and 619 transitions. Second operand 4 states. [2019-11-26 02:17:30,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:30,138 INFO L93 Difference]: Finished difference Result 830 states and 1344 transitions. [2019-11-26 02:17:30,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:30,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 119 [2019-11-26 02:17:30,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:30,142 INFO L225 Difference]: With dead ends: 830 [2019-11-26 02:17:30,142 INFO L226 Difference]: Without dead ends: 461 [2019-11-26 02:17:30,142 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:17:30,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2019-11-26 02:17:30,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 422. [2019-11-26 02:17:30,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-11-26 02:17:30,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 689 transitions. [2019-11-26 02:17:30,159 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 689 transitions. Word has length 119 [2019-11-26 02:17:30,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:30,159 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 689 transitions. [2019-11-26 02:17:30,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:30,159 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 689 transitions. [2019-11-26 02:17:30,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-11-26 02:17:30,161 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:30,161 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] [2019-11-26 02:17:30,161 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:30,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:30,161 INFO L82 PathProgramCache]: Analyzing trace with hash 320708979, now seen corresponding path program 1 times [2019-11-26 02:17:30,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:30,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666362369] [2019-11-26 02:17:30,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:30,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:30,309 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:17:30,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666362369] [2019-11-26 02:17:30,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:30,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:17:30,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988239190] [2019-11-26 02:17:30,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:17:30,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:30,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:17:30,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:17:30,313 INFO L87 Difference]: Start difference. First operand 422 states and 689 transitions. Second operand 5 states. [2019-11-26 02:17:30,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:30,774 INFO L93 Difference]: Finished difference Result 932 states and 1511 transitions. [2019-11-26 02:17:30,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:30,775 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 119 [2019-11-26 02:17:30,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:30,778 INFO L225 Difference]: With dead ends: 932 [2019-11-26 02:17:30,778 INFO L226 Difference]: Without dead ends: 522 [2019-11-26 02:17:30,779 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:17:30,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2019-11-26 02:17:30,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 422. [2019-11-26 02:17:30,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2019-11-26 02:17:30,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 689 transitions. [2019-11-26 02:17:30,796 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 689 transitions. Word has length 119 [2019-11-26 02:17:30,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:30,796 INFO L462 AbstractCegarLoop]: Abstraction has 422 states and 689 transitions. [2019-11-26 02:17:30,797 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:17:30,797 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 689 transitions. [2019-11-26 02:17:30,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-26 02:17:30,798 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:30,798 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] [2019-11-26 02:17:30,798 INFO L410 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:30,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:30,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1111319742, now seen corresponding path program 1 times [2019-11-26 02:17:30,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:30,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394575720] [2019-11-26 02:17:30,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:30,851 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:17:30,851 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394575720] [2019-11-26 02:17:30,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:30,852 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:30,852 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144891190] [2019-11-26 02:17:30,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:30,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:30,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:30,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:30,853 INFO L87 Difference]: Start difference. First operand 422 states and 689 transitions. Second operand 4 states. [2019-11-26 02:17:31,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:31,232 INFO L93 Difference]: Finished difference Result 912 states and 1483 transitions. [2019-11-26 02:17:31,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:31,232 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-11-26 02:17:31,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:31,234 INFO L225 Difference]: With dead ends: 912 [2019-11-26 02:17:31,234 INFO L226 Difference]: Without dead ends: 502 [2019-11-26 02:17:31,235 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:17:31,236 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 502 states. [2019-11-26 02:17:31,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 502 to 436. [2019-11-26 02:17:31,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2019-11-26 02:17:31,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 710 transitions. [2019-11-26 02:17:31,253 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 710 transitions. Word has length 120 [2019-11-26 02:17:31,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:31,253 INFO L462 AbstractCegarLoop]: Abstraction has 436 states and 710 transitions. [2019-11-26 02:17:31,253 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:31,254 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 710 transitions. [2019-11-26 02:17:31,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-26 02:17:31,255 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:31,255 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] [2019-11-26 02:17:31,255 INFO L410 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:31,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:31,256 INFO L82 PathProgramCache]: Analyzing trace with hash -161018814, now seen corresponding path program 1 times [2019-11-26 02:17:31,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:31,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385953393] [2019-11-26 02:17:31,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:31,333 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:17:31,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385953393] [2019-11-26 02:17:31,334 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:17:31,334 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:17:31,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12416192] [2019-11-26 02:17:31,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:17:31,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:17:31,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:17:31,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:17:31,335 INFO L87 Difference]: Start difference. First operand 436 states and 710 transitions. Second operand 4 states. [2019-11-26 02:17:31,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:17:31,658 INFO L93 Difference]: Finished difference Result 924 states and 1501 transitions. [2019-11-26 02:17:31,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:17:31,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 120 [2019-11-26 02:17:31,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:17:31,661 INFO L225 Difference]: With dead ends: 924 [2019-11-26 02:17:31,661 INFO L226 Difference]: Without dead ends: 498 [2019-11-26 02:17:31,661 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:17:31,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-11-26 02:17:31,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 462. [2019-11-26 02:17:31,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 462 states. [2019-11-26 02:17:31,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 756 transitions. [2019-11-26 02:17:31,679 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 756 transitions. Word has length 120 [2019-11-26 02:17:31,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:17:31,679 INFO L462 AbstractCegarLoop]: Abstraction has 462 states and 756 transitions. [2019-11-26 02:17:31,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:17:31,680 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 756 transitions. [2019-11-26 02:17:31,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-26 02:17:31,681 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:17:31,681 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] [2019-11-26 02:17:31,681 INFO L410 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:17:31,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:17:31,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1621672855, now seen corresponding path program 1 times [2019-11-26 02:17:31,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:17:31,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361088285] [2019-11-26 02:17:31,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:17:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:31,798 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:17:31,798 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361088285] [2019-11-26 02:17:31,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [313176631] [2019-11-26 02:17:31,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_e56a8f3b-2632-48dc-a03d-0b9fc8e56da1/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:17:31,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:17:32,002 INFO L255 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 02:17:32,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:17:32,086 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:17:32,095 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:17:32,098 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:17:32,098 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:17:32,098 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:4 [2019-11-26 02:17:32,114 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_319|, |v_#memory_$Pointer$.base_319|], 5=[|v_#memory_int_319|]} [2019-11-26 02:17:32,117 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:17:32,118 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:17:32,122 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:17:32,127 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:17:32,128 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:17:32,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:17:32,195 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:17:32,195 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:17:32,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:17:32,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:17:32,198 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:17:32,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:17:32,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:17:32,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:17:32,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:17:32,210 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:17:32,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:17:32,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:17:32,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:17:32,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:17:32,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:17:32,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:17:32,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:17:32,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:17:32,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:17:32,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:17:32,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:17:32,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:17:32,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:17:32,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:17:32,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:17:32,239 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:17:32,241 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:17:32,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:17:32,242 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:17:32,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:17:32,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:17:32,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:17:32,249 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:17:32,462 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:17:32,463 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:17:32,466 INFO L168 Benchmark]: Toolchain (without parser) took 25518.42 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 538.4 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -182.1 MB). Peak memory consumption was 356.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:17:32,466 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:17:32,467 INFO L168 Benchmark]: CACSL2BoogieTranslator took 764.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -154.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:17:32,467 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:17:32,467 INFO L168 Benchmark]: Boogie Preprocessor took 128.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. [2019-11-26 02:17:32,467 INFO L168 Benchmark]: RCFGBuilder took 1756.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 917.4 MB in the end (delta: 168.8 MB). Peak memory consumption was 168.8 MB. Max. memory is 11.5 GB. [2019-11-26 02:17:32,468 INFO L168 Benchmark]: TraceAbstraction took 22761.05 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 406.3 MB). Free memory was 917.4 MB in the beginning and 1.1 GB in the end (delta: -210.8 MB). Peak memory consumption was 195.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:17:32,469 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 764.47 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.1 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -154.0 MB). Peak memory consumption was 24.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 103.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 128.99 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1756.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 917.4 MB in the end (delta: 168.8 MB). Peak memory consumption was 168.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22761.05 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 406.3 MB). Free memory was 917.4 MB in the beginning and 1.1 GB in the end (delta: -210.8 MB). Peak memory consumption was 195.5 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:17:34,198 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:17:34,200 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:17:34,215 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:17:34,216 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:17:34,217 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:17:34,219 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:17:34,228 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:17:34,232 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:17:34,236 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:17:34,237 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:17:34,238 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:17:34,239 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:17:34,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:17:34,242 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:17:34,243 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:17:34,245 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:17:34,245 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:17:34,247 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:17:34,251 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:17:34,254 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:17:34,257 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:17:34,258 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:17:34,258 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:17:34,260 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:17:34,260 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:17:34,261 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:17:34,261 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:17:34,261 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:17:34,262 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:17:34,262 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:17:34,263 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:17:34,263 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:17:34,264 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:17:34,266 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:17:34,266 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:17:34,267 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:17:34,267 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:17:34,268 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:17:34,268 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:17:34,270 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:17:34,270 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_e56a8f3b-2632-48dc-a03d-0b9fc8e56da1/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-11-26 02:17:34,295 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:17:34,296 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:17:34,297 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:17:34,297 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:17:34,298 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:17:34,298 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:17:34,298 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:17:34,298 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:17:34,299 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:17:34,299 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:17:34,300 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:17:34,300 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:17:34,301 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:17:34,301 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:17:34,301 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:17:34,301 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:17:34,302 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 02:17:34,302 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-26 02:17:34,302 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-26 02:17:34,303 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:17:34,303 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:17:34,303 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 02:17:34,303 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:17:34,304 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:17:34,304 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 02:17:34,304 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:17:34,304 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:17:34,304 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:17:34,305 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:17:34,305 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:17:34,305 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:17:34,305 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-11-26 02:17:34,306 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-26 02:17:34,306 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:17:34,306 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:17:34,307 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_e56a8f3b-2632-48dc-a03d-0b9fc8e56da1/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 -> 24241c008259f315336df16b66c76f690577877c [2019-11-26 02:17:34,614 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:17:34,624 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:17:34,627 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:17:34,628 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:17:34,629 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:17:34,629 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_e56a8f3b-2632-48dc-a03d-0b9fc8e56da1/bin/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.10.i.cil-2.c [2019-11-26 02:17:34,669 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e56a8f3b-2632-48dc-a03d-0b9fc8e56da1/bin/utaipan/data/f1fe5038d/e5ee40fdbfa04b4bb535a4c8c4fc2dee/FLAG40adcee70 [2019-11-26 02:17:35,204 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:17:35,205 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_e56a8f3b-2632-48dc-a03d-0b9fc8e56da1/sv-benchmarks/c/ssh/s3_srvr.blast.10.i.cil-2.c [2019-11-26 02:17:35,229 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_e56a8f3b-2632-48dc-a03d-0b9fc8e56da1/bin/utaipan/data/f1fe5038d/e5ee40fdbfa04b4bb535a4c8c4fc2dee/FLAG40adcee70 [2019-11-26 02:17:35,697 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_e56a8f3b-2632-48dc-a03d-0b9fc8e56da1/bin/utaipan/data/f1fe5038d/e5ee40fdbfa04b4bb535a4c8c4fc2dee [2019-11-26 02:17:35,699 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:17:35,700 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:17:35,701 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:17:35,701 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:17:35,704 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:17:35,705 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:17:35" (1/1) ... [2019-11-26 02:17:35,707 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2acf2ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:17:35, skipping insertion in model container [2019-11-26 02:17:35,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:17:35" (1/1) ... [2019-11-26 02:17:35,714 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:17:35,762 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:17:36,137 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:17:36,138 INFO L968 CHandler]: at location: C: (SSL_METHOD *)((void *)0) [1038] [2019-11-26 02:17:36,138 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-26 02:17:36,178 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:17:36,183 INFO L168 Benchmark]: Toolchain (without parser) took 481.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.0 MB). Free memory was 952.4 MB in the beginning and 1.2 GB in the end (delta: -203.0 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:17:36,184 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:17:36,186 INFO L168 Benchmark]: CACSL2BoogieTranslator took 479.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.0 MB). Free memory was 952.4 MB in the beginning and 1.2 GB in the end (delta: -203.0 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:17:36,187 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 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 479.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 173.0 MB). Free memory was 952.4 MB in the beginning and 1.2 GB in the end (delta: -203.0 MB). Peak memory consumption was 28.5 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...