./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.16.i.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c2433536-9daf-416b-9004-071c2ded8e98/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c2433536-9daf-416b-9004-071c2ded8e98/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c2433536-9daf-416b-9004-071c2ded8e98/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c2433536-9daf-416b-9004-071c2ded8e98/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.16.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c2433536-9daf-416b-9004-071c2ded8e98/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c2433536-9daf-416b-9004-071c2ded8e98/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 5d1ed5f95c4e8acd6cf76ffe908c8c8bb3dc8352 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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_c2433536-9daf-416b-9004-071c2ded8e98/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c2433536-9daf-416b-9004-071c2ded8e98/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c2433536-9daf-416b-9004-071c2ded8e98/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c2433536-9daf-416b-9004-071c2ded8e98/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.16.i.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c2433536-9daf-416b-9004-071c2ded8e98/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c2433536-9daf-416b-9004-071c2ded8e98/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 5d1ed5f95c4e8acd6cf76ffe908c8c8bb3dc8352 .................................................................................................................................................................. 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:39:19,841 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:39:19,842 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:39:19,852 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:39:19,853 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:39:19,854 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:39:19,855 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:39:19,858 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:39:19,866 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:39:19,867 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:39:19,868 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:39:19,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:39:19,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:39:19,871 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:39:19,872 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:39:19,873 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:39:19,876 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:39:19,880 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:39:19,883 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:39:19,886 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:39:19,891 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:39:19,896 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:39:19,897 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:39:19,902 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:39:19,905 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:39:19,909 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:39:19,909 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:39:19,910 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:39:19,911 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:39:19,913 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:39:19,914 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:39:19,915 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:39:19,916 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:39:19,916 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:39:19,918 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:39:19,919 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:39:19,920 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:39:19,920 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:39:19,920 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:39:19,922 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:39:19,923 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:39:19,924 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c2433536-9daf-416b-9004-071c2ded8e98/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:39:19,945 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:39:19,946 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:39:19,947 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:39:19,947 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:39:19,947 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:39:19,948 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:39:19,948 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:39:19,948 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:39:19,948 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:39:19,949 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:39:19,950 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:39:19,950 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:39:19,950 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:39:19,951 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:39:19,951 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:39:19,952 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:39:19,952 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:39:19,952 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:39:19,953 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:39:19,953 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:39:19,953 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:39:19,953 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:39:19,954 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:39:19,954 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:39:19,954 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:39:19,954 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:39:19,955 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:39:19,955 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:39:19,955 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:39:19,956 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:39:19,956 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:39:19,956 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:39:19,957 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:39:19,957 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:39:19,957 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:39:19,957 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:39:19,958 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:39:19,958 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_c2433536-9daf-416b-9004-071c2ded8e98/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 -> 5d1ed5f95c4e8acd6cf76ffe908c8c8bb3dc8352 [2019-11-26 02:39:20,126 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:39:20,139 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:39:20,143 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:39:20,144 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:39:20,145 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:39:20,146 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c2433536-9daf-416b-9004-071c2ded8e98/bin/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.16.i.cil-1.c [2019-11-26 02:39:20,206 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c2433536-9daf-416b-9004-071c2ded8e98/bin/utaipan/data/e06c23dbe/b9f9347f74a74600a47ed916c4d26942/FLAGa8fc7968e [2019-11-26 02:39:20,838 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:39:20,838 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c2433536-9daf-416b-9004-071c2ded8e98/sv-benchmarks/c/ssh/s3_srvr.blast.16.i.cil-1.c [2019-11-26 02:39:20,860 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c2433536-9daf-416b-9004-071c2ded8e98/bin/utaipan/data/e06c23dbe/b9f9347f74a74600a47ed916c4d26942/FLAGa8fc7968e [2019-11-26 02:39:21,085 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c2433536-9daf-416b-9004-071c2ded8e98/bin/utaipan/data/e06c23dbe/b9f9347f74a74600a47ed916c4d26942 [2019-11-26 02:39:21,087 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:39:21,088 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:39:21,089 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:39:21,089 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:39:21,092 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:39:21,093 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:39:21" (1/1) ... [2019-11-26 02:39:21,095 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c8bb2d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:39:21, skipping insertion in model container [2019-11-26 02:39:21,096 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:39:21" (1/1) ... [2019-11-26 02:39:21,102 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:39:21,156 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:39:21,658 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:39:21,678 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:39:21,829 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:39:21,850 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:39:21,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:39:21 WrapperNode [2019-11-26 02:39:21,851 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:39:21,852 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:39:21,852 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:39:21,852 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:39:21,860 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:39:21" (1/1) ... [2019-11-26 02:39:21,896 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:39:21" (1/1) ... [2019-11-26 02:39:21,936 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:39:21,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:39:21,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:39:21,936 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:39:21,945 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:39:21" (1/1) ... [2019-11-26 02:39:21,945 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:39:21" (1/1) ... [2019-11-26 02:39:21,953 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:39:21" (1/1) ... [2019-11-26 02:39:21,953 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:39:21" (1/1) ... [2019-11-26 02:39:22,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:39:21" (1/1) ... [2019-11-26 02:39:22,033 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:39:21" (1/1) ... [2019-11-26 02:39:22,050 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:39:21" (1/1) ... [2019-11-26 02:39:22,056 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:39:22,072 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:39:22,072 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:39:22,072 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:39:22,073 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:39:21" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2433536-9daf-416b-9004-071c2ded8e98/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:39:22,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-26 02:39:22,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-26 02:39:22,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 02:39:22,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-26 02:39:22,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-26 02:39:22,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-26 02:39:22,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-26 02:39:22,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 02:39:22,157 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:39:22,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:39:22,420 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 02:39:23,308 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-26 02:39:23,309 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-26 02:39:24,099 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:39:24,099 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:39:24,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:39:24 BoogieIcfgContainer [2019-11-26 02:39:24,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:39:24,102 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:39:24,102 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:39:24,104 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:39:24,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:39:21" (1/3) ... [2019-11-26 02:39:24,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed89325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:39:24, skipping insertion in model container [2019-11-26 02:39:24,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:39:21" (2/3) ... [2019-11-26 02:39:24,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ed89325 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:39:24, skipping insertion in model container [2019-11-26 02:39:24,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:39:24" (3/3) ... [2019-11-26 02:39:24,107 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.16.i.cil-1.c [2019-11-26 02:39:24,116 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:39:24,124 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:39:24,134 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:39:24,158 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:39:24,159 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:39:24,159 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:39:24,159 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:39:24,159 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:39:24,159 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:39:24,160 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:39:24,161 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:39:24,186 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states. [2019-11-26 02:39:24,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-11-26 02:39:24,198 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:24,199 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:24,199 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:24,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:24,205 INFO L82 PathProgramCache]: Analyzing trace with hash -936557133, now seen corresponding path program 1 times [2019-11-26 02:39:24,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:24,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822299476] [2019-11-26 02:39:24,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:24,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:24,598 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:39:24,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822299476] [2019-11-26 02:39:24,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:24,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:39:24,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420396287] [2019-11-26 02:39:24,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:39:24,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:24,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:39:24,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:39:24,625 INFO L87 Difference]: Start difference. First operand 110 states. Second operand 4 states. [2019-11-26 02:39:25,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:25,074 INFO L93 Difference]: Finished difference Result 243 states and 420 transitions. [2019-11-26 02:39:25,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:39:25,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-11-26 02:39:25,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:25,092 INFO L225 Difference]: With dead ends: 243 [2019-11-26 02:39:25,092 INFO L226 Difference]: Without dead ends: 129 [2019-11-26 02:39:25,095 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:39:25,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-26 02:39:25,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2019-11-26 02:39:25,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-26 02:39:25,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 179 transitions. [2019-11-26 02:39:25,135 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 179 transitions. Word has length 37 [2019-11-26 02:39:25,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:25,136 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 179 transitions. [2019-11-26 02:39:25,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:39:25,136 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 179 transitions. [2019-11-26 02:39:25,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-11-26 02:39:25,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:25,138 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:25,138 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:25,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:25,139 INFO L82 PathProgramCache]: Analyzing trace with hash -539575034, now seen corresponding path program 1 times [2019-11-26 02:39:25,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:25,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983134509] [2019-11-26 02:39:25,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:25,267 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:39:25,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983134509] [2019-11-26 02:39:25,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:25,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:39:25,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330429463] [2019-11-26 02:39:25,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:39:25,272 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:25,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:39:25,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:39:25,273 INFO L87 Difference]: Start difference. First operand 117 states and 179 transitions. Second operand 4 states. [2019-11-26 02:39:25,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:25,608 INFO L93 Difference]: Finished difference Result 234 states and 352 transitions. [2019-11-26 02:39:25,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:39:25,609 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-11-26 02:39:25,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:25,611 INFO L225 Difference]: With dead ends: 234 [2019-11-26 02:39:25,611 INFO L226 Difference]: Without dead ends: 129 [2019-11-26 02:39:25,612 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:39:25,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-26 02:39:25,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2019-11-26 02:39:25,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-26 02:39:25,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 178 transitions. [2019-11-26 02:39:25,629 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 178 transitions. Word has length 47 [2019-11-26 02:39:25,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:25,629 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 178 transitions. [2019-11-26 02:39:25,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:39:25,630 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 178 transitions. [2019-11-26 02:39:25,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-26 02:39:25,636 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:25,637 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:25,637 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:25,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:25,637 INFO L82 PathProgramCache]: Analyzing trace with hash 132674094, now seen corresponding path program 1 times [2019-11-26 02:39:25,637 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:25,637 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927563606] [2019-11-26 02:39:25,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:25,742 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:39:25,743 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927563606] [2019-11-26 02:39:25,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:25,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:39:25,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117546235] [2019-11-26 02:39:25,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:39:25,744 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:25,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:39:25,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:39:25,745 INFO L87 Difference]: Start difference. First operand 117 states and 178 transitions. Second operand 4 states. [2019-11-26 02:39:26,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:26,016 INFO L93 Difference]: Finished difference Result 234 states and 351 transitions. [2019-11-26 02:39:26,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:39:26,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2019-11-26 02:39:26,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:26,018 INFO L225 Difference]: With dead ends: 234 [2019-11-26 02:39:26,018 INFO L226 Difference]: Without dead ends: 129 [2019-11-26 02:39:26,019 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:39:26,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-26 02:39:26,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2019-11-26 02:39:26,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-26 02:39:26,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 177 transitions. [2019-11-26 02:39:26,028 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 177 transitions. Word has length 48 [2019-11-26 02:39:26,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:26,029 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 177 transitions. [2019-11-26 02:39:26,029 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:39:26,029 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 177 transitions. [2019-11-26 02:39:26,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-26 02:39:26,031 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:26,031 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:26,031 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:26,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:26,031 INFO L82 PathProgramCache]: Analyzing trace with hash 223358559, now seen corresponding path program 1 times [2019-11-26 02:39:26,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:26,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806876157] [2019-11-26 02:39:26,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:26,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:26,083 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:39:26,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806876157] [2019-11-26 02:39:26,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:26,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:39:26,084 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090693490] [2019-11-26 02:39:26,084 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:39:26,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:26,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:39:26,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:39:26,085 INFO L87 Difference]: Start difference. First operand 117 states and 177 transitions. Second operand 4 states. [2019-11-26 02:39:26,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:26,340 INFO L93 Difference]: Finished difference Result 234 states and 350 transitions. [2019-11-26 02:39:26,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:39:26,341 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-26 02:39:26,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:26,342 INFO L225 Difference]: With dead ends: 234 [2019-11-26 02:39:26,342 INFO L226 Difference]: Without dead ends: 129 [2019-11-26 02:39:26,343 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:39:26,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-26 02:39:26,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2019-11-26 02:39:26,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-26 02:39:26,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 176 transitions. [2019-11-26 02:39:26,358 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 176 transitions. Word has length 49 [2019-11-26 02:39:26,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:26,358 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 176 transitions. [2019-11-26 02:39:26,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:39:26,358 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 176 transitions. [2019-11-26 02:39:26,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-26 02:39:26,362 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:26,363 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:26,363 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:26,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:26,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1780592160, now seen corresponding path program 1 times [2019-11-26 02:39:26,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:26,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665122876] [2019-11-26 02:39:26,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:26,455 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:39:26,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665122876] [2019-11-26 02:39:26,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:26,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:39:26,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272104284] [2019-11-26 02:39:26,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:39:26,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:26,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:39:26,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:39:26,457 INFO L87 Difference]: Start difference. First operand 117 states and 176 transitions. Second operand 4 states. [2019-11-26 02:39:26,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:26,691 INFO L93 Difference]: Finished difference Result 234 states and 349 transitions. [2019-11-26 02:39:26,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:39:26,692 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-26 02:39:26,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:26,693 INFO L225 Difference]: With dead ends: 234 [2019-11-26 02:39:26,693 INFO L226 Difference]: Without dead ends: 129 [2019-11-26 02:39:26,694 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:39:26,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-26 02:39:26,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2019-11-26 02:39:26,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-26 02:39:26,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 175 transitions. [2019-11-26 02:39:26,701 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 175 transitions. Word has length 49 [2019-11-26 02:39:26,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:26,701 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 175 transitions. [2019-11-26 02:39:26,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:39:26,701 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 175 transitions. [2019-11-26 02:39:26,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-26 02:39:26,702 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:26,702 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:26,702 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:26,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:26,702 INFO L82 PathProgramCache]: Analyzing trace with hash 156369177, now seen corresponding path program 1 times [2019-11-26 02:39:26,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:26,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923690392] [2019-11-26 02:39:26,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:26,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:26,754 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:39:26,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923690392] [2019-11-26 02:39:26,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:26,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:39:26,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856999140] [2019-11-26 02:39:26,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:39:26,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:26,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:39:26,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:39:26,756 INFO L87 Difference]: Start difference. First operand 117 states and 175 transitions. Second operand 4 states. [2019-11-26 02:39:27,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:27,010 INFO L93 Difference]: Finished difference Result 234 states and 348 transitions. [2019-11-26 02:39:27,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:39:27,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-26 02:39:27,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:27,014 INFO L225 Difference]: With dead ends: 234 [2019-11-26 02:39:27,014 INFO L226 Difference]: Without dead ends: 129 [2019-11-26 02:39:27,014 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:39:27,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-26 02:39:27,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2019-11-26 02:39:27,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-26 02:39:27,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 174 transitions. [2019-11-26 02:39:27,021 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 174 transitions. Word has length 49 [2019-11-26 02:39:27,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:27,021 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 174 transitions. [2019-11-26 02:39:27,021 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:39:27,021 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 174 transitions. [2019-11-26 02:39:27,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-26 02:39:27,022 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:27,022 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:27,023 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:27,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:27,023 INFO L82 PathProgramCache]: Analyzing trace with hash -2088892631, now seen corresponding path program 1 times [2019-11-26 02:39:27,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:27,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977119814] [2019-11-26 02:39:27,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:27,072 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:39:27,072 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977119814] [2019-11-26 02:39:27,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:27,073 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:39:27,073 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140623965] [2019-11-26 02:39:27,073 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:39:27,073 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:27,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:39:27,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:39:27,074 INFO L87 Difference]: Start difference. First operand 117 states and 174 transitions. Second operand 4 states. [2019-11-26 02:39:27,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:27,309 INFO L93 Difference]: Finished difference Result 234 states and 347 transitions. [2019-11-26 02:39:27,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:39:27,310 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-26 02:39:27,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:27,311 INFO L225 Difference]: With dead ends: 234 [2019-11-26 02:39:27,311 INFO L226 Difference]: Without dead ends: 129 [2019-11-26 02:39:27,312 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:39:27,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-26 02:39:27,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2019-11-26 02:39:27,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-26 02:39:27,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 173 transitions. [2019-11-26 02:39:27,316 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 173 transitions. Word has length 50 [2019-11-26 02:39:27,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:27,316 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 173 transitions. [2019-11-26 02:39:27,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:39:27,317 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 173 transitions. [2019-11-26 02:39:27,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-26 02:39:27,317 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:27,318 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:27,318 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:27,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:27,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1785607439, now seen corresponding path program 1 times [2019-11-26 02:39:27,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:27,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820041645] [2019-11-26 02:39:27,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:27,410 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:39:27,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820041645] [2019-11-26 02:39:27,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:27,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:39:27,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495279885] [2019-11-26 02:39:27,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:39:27,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:27,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:39:27,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:39:27,412 INFO L87 Difference]: Start difference. First operand 117 states and 173 transitions. Second operand 4 states. [2019-11-26 02:39:27,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:27,624 INFO L93 Difference]: Finished difference Result 232 states and 344 transitions. [2019-11-26 02:39:27,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:39:27,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-26 02:39:27,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:27,626 INFO L225 Difference]: With dead ends: 232 [2019-11-26 02:39:27,626 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:39:27,627 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:39:27,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:39:27,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 117. [2019-11-26 02:39:27,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-26 02:39:27,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 172 transitions. [2019-11-26 02:39:27,633 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 172 transitions. Word has length 50 [2019-11-26 02:39:27,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:27,633 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 172 transitions. [2019-11-26 02:39:27,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:39:27,633 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 172 transitions. [2019-11-26 02:39:27,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-26 02:39:27,634 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:27,634 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:27,635 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:27,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:27,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1582737798, now seen corresponding path program 1 times [2019-11-26 02:39:27,635 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:27,636 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704753977] [2019-11-26 02:39:27,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:27,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:27,683 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:39:27,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704753977] [2019-11-26 02:39:27,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:27,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:39:27,684 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641852696] [2019-11-26 02:39:27,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:39:27,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:27,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:39:27,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:39:27,685 INFO L87 Difference]: Start difference. First operand 117 states and 172 transitions. Second operand 4 states. [2019-11-26 02:39:27,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:27,891 INFO L93 Difference]: Finished difference Result 224 states and 333 transitions. [2019-11-26 02:39:27,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:39:27,892 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-26 02:39:27,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:27,893 INFO L225 Difference]: With dead ends: 224 [2019-11-26 02:39:27,893 INFO L226 Difference]: Without dead ends: 119 [2019-11-26 02:39:27,893 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:39:27,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2019-11-26 02:39:27,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 117. [2019-11-26 02:39:27,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-26 02:39:27,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 171 transitions. [2019-11-26 02:39:27,898 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 171 transitions. Word has length 51 [2019-11-26 02:39:27,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:27,898 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 171 transitions. [2019-11-26 02:39:27,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:39:27,898 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 171 transitions. [2019-11-26 02:39:27,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-26 02:39:27,899 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:27,899 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:27,899 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:27,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:27,899 INFO L82 PathProgramCache]: Analyzing trace with hash -784759912, now seen corresponding path program 1 times [2019-11-26 02:39:27,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:27,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099968276] [2019-11-26 02:39:27,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:27,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:27,953 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:39:27,954 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099968276] [2019-11-26 02:39:27,954 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:27,954 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:39:27,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214037173] [2019-11-26 02:39:27,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:39:27,955 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:27,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:39:27,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:39:27,955 INFO L87 Difference]: Start difference. First operand 117 states and 171 transitions. Second operand 4 states. [2019-11-26 02:39:28,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:28,246 INFO L93 Difference]: Finished difference Result 256 states and 381 transitions. [2019-11-26 02:39:28,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:39:28,247 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-26 02:39:28,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:28,249 INFO L225 Difference]: With dead ends: 256 [2019-11-26 02:39:28,249 INFO L226 Difference]: Without dead ends: 151 [2019-11-26 02:39:28,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:39:28,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-26 02:39:28,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 137. [2019-11-26 02:39:28,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-26 02:39:28,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 205 transitions. [2019-11-26 02:39:28,254 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 205 transitions. Word has length 52 [2019-11-26 02:39:28,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:28,255 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 205 transitions. [2019-11-26 02:39:28,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:39:28,255 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 205 transitions. [2019-11-26 02:39:28,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-26 02:39:28,256 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:28,256 INFO L410 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:28,256 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:28,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:28,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1190223701, now seen corresponding path program 1 times [2019-11-26 02:39:28,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:28,257 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866525212] [2019-11-26 02:39:28,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:28,323 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:39:28,323 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866525212] [2019-11-26 02:39:28,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:28,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:39:28,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986363635] [2019-11-26 02:39:28,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:39:28,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:28,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:39:28,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:39:28,325 INFO L87 Difference]: Start difference. First operand 137 states and 205 transitions. Second operand 4 states. [2019-11-26 02:39:28,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:28,588 INFO L93 Difference]: Finished difference Result 276 states and 414 transitions. [2019-11-26 02:39:28,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:39:28,588 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 62 [2019-11-26 02:39:28,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:28,589 INFO L225 Difference]: With dead ends: 276 [2019-11-26 02:39:28,590 INFO L226 Difference]: Without dead ends: 151 [2019-11-26 02:39:28,590 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:39:28,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-26 02:39:28,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 137. [2019-11-26 02:39:28,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2019-11-26 02:39:28,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 204 transitions. [2019-11-26 02:39:28,595 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 204 transitions. Word has length 62 [2019-11-26 02:39:28,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:28,596 INFO L462 AbstractCegarLoop]: Abstraction has 137 states and 204 transitions. [2019-11-26 02:39:28,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:39:28,596 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 204 transitions. [2019-11-26 02:39:28,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-26 02:39:28,597 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:28,597 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:28,597 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:28,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:28,598 INFO L82 PathProgramCache]: Analyzing trace with hash 1437401897, now seen corresponding path program 1 times [2019-11-26 02:39:28,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:28,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461350482] [2019-11-26 02:39:28,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:28,665 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:39:28,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461350482] [2019-11-26 02:39:28,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:28,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:39:28,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380560194] [2019-11-26 02:39:28,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:39:28,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:28,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:39:28,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:39:28,666 INFO L87 Difference]: Start difference. First operand 137 states and 204 transitions. Second operand 5 states. [2019-11-26 02:39:29,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:29,080 INFO L93 Difference]: Finished difference Result 279 states and 419 transitions. [2019-11-26 02:39:29,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:39:29,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-11-26 02:39:29,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:29,083 INFO L225 Difference]: With dead ends: 279 [2019-11-26 02:39:29,083 INFO L226 Difference]: Without dead ends: 154 [2019-11-26 02:39:29,084 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:39:29,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2019-11-26 02:39:29,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2019-11-26 02:39:29,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-26 02:39:29,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 224 transitions. [2019-11-26 02:39:29,089 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 224 transitions. Word has length 63 [2019-11-26 02:39:29,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:29,090 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 224 transitions. [2019-11-26 02:39:29,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:39:29,090 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 224 transitions. [2019-11-26 02:39:29,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-26 02:39:29,091 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:29,091 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:29,091 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:29,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:29,091 INFO L82 PathProgramCache]: Analyzing trace with hash 11264069, now seen corresponding path program 1 times [2019-11-26 02:39:29,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:29,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914245913] [2019-11-26 02:39:29,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:29,147 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:39:29,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914245913] [2019-11-26 02:39:29,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:29,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:39:29,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999341574] [2019-11-26 02:39:29,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:39:29,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:29,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:39:29,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:39:29,149 INFO L87 Difference]: Start difference. First operand 153 states and 224 transitions. Second operand 4 states. [2019-11-26 02:39:29,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:29,544 INFO L93 Difference]: Finished difference Result 308 states and 451 transitions. [2019-11-26 02:39:29,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:39:29,546 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-26 02:39:29,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:29,547 INFO L225 Difference]: With dead ends: 308 [2019-11-26 02:39:29,547 INFO L226 Difference]: Without dead ends: 167 [2019-11-26 02:39:29,548 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:39:29,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-11-26 02:39:29,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 153. [2019-11-26 02:39:29,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-26 02:39:29,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 223 transitions. [2019-11-26 02:39:29,559 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 223 transitions. Word has length 64 [2019-11-26 02:39:29,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:29,559 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 223 transitions. [2019-11-26 02:39:29,559 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:39:29,559 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 223 transitions. [2019-11-26 02:39:29,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-26 02:39:29,561 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:29,561 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:29,562 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:29,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:29,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1948225406, now seen corresponding path program 1 times [2019-11-26 02:39:29,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:29,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870388947] [2019-11-26 02:39:29,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:29,627 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:39:29,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870388947] [2019-11-26 02:39:29,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:29,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:39:29,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78225598] [2019-11-26 02:39:29,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:39:29,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:29,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:39:29,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:39:29,630 INFO L87 Difference]: Start difference. First operand 153 states and 223 transitions. Second operand 4 states. [2019-11-26 02:39:29,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:29,972 INFO L93 Difference]: Finished difference Result 308 states and 449 transitions. [2019-11-26 02:39:29,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:39:29,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-26 02:39:29,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:29,975 INFO L225 Difference]: With dead ends: 308 [2019-11-26 02:39:29,975 INFO L226 Difference]: Without dead ends: 167 [2019-11-26 02:39:29,976 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:39:29,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-11-26 02:39:29,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 153. [2019-11-26 02:39:29,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-26 02:39:29,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 222 transitions. [2019-11-26 02:39:29,983 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 222 transitions. Word has length 64 [2019-11-26 02:39:29,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:29,984 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 222 transitions. [2019-11-26 02:39:29,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:39:29,984 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 222 transitions. [2019-11-26 02:39:29,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-26 02:39:29,985 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:29,985 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:29,985 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:29,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:29,986 INFO L82 PathProgramCache]: Analyzing trace with hash 304489505, now seen corresponding path program 1 times [2019-11-26 02:39:29,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:29,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124566920] [2019-11-26 02:39:29,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:30,041 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:39:30,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124566920] [2019-11-26 02:39:30,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:30,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:39:30,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660518166] [2019-11-26 02:39:30,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:39:30,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:30,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:39:30,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:39:30,043 INFO L87 Difference]: Start difference. First operand 153 states and 222 transitions. Second operand 4 states. [2019-11-26 02:39:30,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:30,410 INFO L93 Difference]: Finished difference Result 308 states and 447 transitions. [2019-11-26 02:39:30,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:39:30,411 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-26 02:39:30,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:30,413 INFO L225 Difference]: With dead ends: 308 [2019-11-26 02:39:30,413 INFO L226 Difference]: Without dead ends: 167 [2019-11-26 02:39:30,414 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:39:30,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-11-26 02:39:30,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 153. [2019-11-26 02:39:30,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-26 02:39:30,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 221 transitions. [2019-11-26 02:39:30,421 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 221 transitions. Word has length 64 [2019-11-26 02:39:30,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:30,422 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 221 transitions. [2019-11-26 02:39:30,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:39:30,422 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 221 transitions. [2019-11-26 02:39:30,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-26 02:39:30,423 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:30,423 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:30,424 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:30,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:30,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1036819942, now seen corresponding path program 1 times [2019-11-26 02:39:30,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:30,425 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962750155] [2019-11-26 02:39:30,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:30,479 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:39:30,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962750155] [2019-11-26 02:39:30,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:30,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:39:30,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307871976] [2019-11-26 02:39:30,481 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:39:30,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:30,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:39:30,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:39:30,482 INFO L87 Difference]: Start difference. First operand 153 states and 221 transitions. Second operand 4 states. [2019-11-26 02:39:30,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:30,820 INFO L93 Difference]: Finished difference Result 308 states and 445 transitions. [2019-11-26 02:39:30,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:39:30,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-26 02:39:30,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:30,823 INFO L225 Difference]: With dead ends: 308 [2019-11-26 02:39:30,823 INFO L226 Difference]: Without dead ends: 167 [2019-11-26 02:39:30,823 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:39:30,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2019-11-26 02:39:30,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 153. [2019-11-26 02:39:30,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-26 02:39:30,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 220 transitions. [2019-11-26 02:39:30,829 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 220 transitions. Word has length 65 [2019-11-26 02:39:30,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:30,829 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 220 transitions. [2019-11-26 02:39:30,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:39:30,829 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 220 transitions. [2019-11-26 02:39:30,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-26 02:39:30,830 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:30,830 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:30,830 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:30,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:30,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1498575690, now seen corresponding path program 1 times [2019-11-26 02:39:30,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:30,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942513739] [2019-11-26 02:39:30,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:30,871 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:39:30,871 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942513739] [2019-11-26 02:39:30,871 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:30,871 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:39:30,872 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908505467] [2019-11-26 02:39:30,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:39:30,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:30,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:39:30,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:39:30,873 INFO L87 Difference]: Start difference. First operand 153 states and 220 transitions. Second operand 4 states. [2019-11-26 02:39:31,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:31,152 INFO L93 Difference]: Finished difference Result 306 states and 441 transitions. [2019-11-26 02:39:31,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:39:31,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-26 02:39:31,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:31,155 INFO L225 Difference]: With dead ends: 306 [2019-11-26 02:39:31,155 INFO L226 Difference]: Without dead ends: 165 [2019-11-26 02:39:31,155 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:39:31,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-26 02:39:31,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 153. [2019-11-26 02:39:31,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-26 02:39:31,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 219 transitions. [2019-11-26 02:39:31,161 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 219 transitions. Word has length 65 [2019-11-26 02:39:31,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:31,161 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 219 transitions. [2019-11-26 02:39:31,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:39:31,161 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 219 transitions. [2019-11-26 02:39:31,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-26 02:39:31,162 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:31,162 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:31,162 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:31,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:31,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1944508090, now seen corresponding path program 1 times [2019-11-26 02:39:31,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:31,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472781358] [2019-11-26 02:39:31,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:31,205 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:39:31,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472781358] [2019-11-26 02:39:31,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:31,206 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:39:31,206 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860221156] [2019-11-26 02:39:31,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:39:31,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:31,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:39:31,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:39:31,207 INFO L87 Difference]: Start difference. First operand 153 states and 219 transitions. Second operand 4 states. [2019-11-26 02:39:31,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:31,528 INFO L93 Difference]: Finished difference Result 306 states and 439 transitions. [2019-11-26 02:39:31,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:39:31,529 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-26 02:39:31,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:31,530 INFO L225 Difference]: With dead ends: 306 [2019-11-26 02:39:31,530 INFO L226 Difference]: Without dead ends: 165 [2019-11-26 02:39:31,531 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:39:31,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-26 02:39:31,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 153. [2019-11-26 02:39:31,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-26 02:39:31,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 218 transitions. [2019-11-26 02:39:31,536 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 218 transitions. Word has length 66 [2019-11-26 02:39:31,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:31,536 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 218 transitions. [2019-11-26 02:39:31,536 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:39:31,537 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 218 transitions. [2019-11-26 02:39:31,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-26 02:39:31,537 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:31,537 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:31,537 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:31,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:31,538 INFO L82 PathProgramCache]: Analyzing trace with hash 209835627, now seen corresponding path program 1 times [2019-11-26 02:39:31,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:31,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917887926] [2019-11-26 02:39:31,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:31,578 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:39:31,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917887926] [2019-11-26 02:39:31,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:31,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:39:31,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852348703] [2019-11-26 02:39:31,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:39:31,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:31,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:39:31,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:39:31,580 INFO L87 Difference]: Start difference. First operand 153 states and 218 transitions. Second operand 4 states. [2019-11-26 02:39:31,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:31,864 INFO L93 Difference]: Finished difference Result 298 states and 428 transitions. [2019-11-26 02:39:31,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:39:31,865 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-26 02:39:31,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:31,866 INFO L225 Difference]: With dead ends: 298 [2019-11-26 02:39:31,866 INFO L226 Difference]: Without dead ends: 157 [2019-11-26 02:39:31,866 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:39:31,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2019-11-26 02:39:31,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 153. [2019-11-26 02:39:31,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2019-11-26 02:39:31,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 217 transitions. [2019-11-26 02:39:31,872 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 217 transitions. Word has length 67 [2019-11-26 02:39:31,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:31,872 INFO L462 AbstractCegarLoop]: Abstraction has 153 states and 217 transitions. [2019-11-26 02:39:31,873 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:39:31,873 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 217 transitions. [2019-11-26 02:39:31,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-26 02:39:31,874 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:31,874 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:31,874 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:31,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:31,874 INFO L82 PathProgramCache]: Analyzing trace with hash -1304722062, now seen corresponding path program 1 times [2019-11-26 02:39:31,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:31,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435852410] [2019-11-26 02:39:31,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:31,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:31,997 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:39:31,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435852410] [2019-11-26 02:39:31,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:31,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:39:31,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512006452] [2019-11-26 02:39:31,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:39:31,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:32,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:39:32,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:39:32,000 INFO L87 Difference]: Start difference. First operand 153 states and 217 transitions. Second operand 6 states. [2019-11-26 02:39:32,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:32,608 INFO L93 Difference]: Finished difference Result 390 states and 565 transitions. [2019-11-26 02:39:32,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:39:32,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-11-26 02:39:32,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:32,614 INFO L225 Difference]: With dead ends: 390 [2019-11-26 02:39:32,614 INFO L226 Difference]: Without dead ends: 249 [2019-11-26 02:39:32,614 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:39:32,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-11-26 02:39:32,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 190. [2019-11-26 02:39:32,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2019-11-26 02:39:32,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 284 transitions. [2019-11-26 02:39:32,622 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 284 transitions. Word has length 70 [2019-11-26 02:39:32,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:32,623 INFO L462 AbstractCegarLoop]: Abstraction has 190 states and 284 transitions. [2019-11-26 02:39:32,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:39:32,623 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 284 transitions. [2019-11-26 02:39:32,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-11-26 02:39:32,624 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:32,624 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:32,624 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:32,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:32,625 INFO L82 PathProgramCache]: Analyzing trace with hash -678727298, now seen corresponding path program 1 times [2019-11-26 02:39:32,625 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:32,625 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704943030] [2019-11-26 02:39:32,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:32,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:32,731 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:39:32,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704943030] [2019-11-26 02:39:32,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:32,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:39:32,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104384822] [2019-11-26 02:39:32,733 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:39:32,733 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:32,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:39:32,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:39:32,734 INFO L87 Difference]: Start difference. First operand 190 states and 284 transitions. Second operand 6 states. [2019-11-26 02:39:33,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:33,385 INFO L93 Difference]: Finished difference Result 420 states and 622 transitions. [2019-11-26 02:39:33,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:39:33,386 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-11-26 02:39:33,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:33,388 INFO L225 Difference]: With dead ends: 420 [2019-11-26 02:39:33,388 INFO L226 Difference]: Without dead ends: 242 [2019-11-26 02:39:33,388 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:39:33,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-26 02:39:33,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 191. [2019-11-26 02:39:33,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2019-11-26 02:39:33,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 285 transitions. [2019-11-26 02:39:33,395 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 285 transitions. Word has length 71 [2019-11-26 02:39:33,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:33,396 INFO L462 AbstractCegarLoop]: Abstraction has 191 states and 285 transitions. [2019-11-26 02:39:33,396 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:39:33,396 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 285 transitions. [2019-11-26 02:39:33,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-26 02:39:33,397 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:33,397 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:33,397 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:33,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:33,397 INFO L82 PathProgramCache]: Analyzing trace with hash 222817055, now seen corresponding path program 1 times [2019-11-26 02:39:33,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:33,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938888338] [2019-11-26 02:39:33,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:33,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:33,482 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:39:33,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938888338] [2019-11-26 02:39:33,482 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:33,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:39:33,483 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880082986] [2019-11-26 02:39:33,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:39:33,483 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:33,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:39:33,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:39:33,484 INFO L87 Difference]: Start difference. First operand 191 states and 285 transitions. Second operand 4 states. [2019-11-26 02:39:33,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:33,885 INFO L93 Difference]: Finished difference Result 432 states and 652 transitions. [2019-11-26 02:39:33,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:39:33,887 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-26 02:39:33,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:33,889 INFO L225 Difference]: With dead ends: 432 [2019-11-26 02:39:33,889 INFO L226 Difference]: Without dead ends: 253 [2019-11-26 02:39:33,889 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:39:33,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-11-26 02:39:33,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 221. [2019-11-26 02:39:33,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-11-26 02:39:33,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 338 transitions. [2019-11-26 02:39:33,898 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 338 transitions. Word has length 82 [2019-11-26 02:39:33,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:33,898 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 338 transitions. [2019-11-26 02:39:33,898 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:39:33,898 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 338 transitions. [2019-11-26 02:39:33,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-26 02:39:33,899 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:33,899 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:33,900 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:33,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:33,900 INFO L82 PathProgramCache]: Analyzing trace with hash -2135188904, now seen corresponding path program 1 times [2019-11-26 02:39:33,900 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:33,900 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652961688] [2019-11-26 02:39:33,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:33,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:33,955 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:39:33,955 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652961688] [2019-11-26 02:39:33,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:33,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:39:33,956 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149527881] [2019-11-26 02:39:33,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:39:33,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:33,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:39:33,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:39:33,959 INFO L87 Difference]: Start difference. First operand 221 states and 338 transitions. Second operand 4 states. [2019-11-26 02:39:34,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:34,492 INFO L93 Difference]: Finished difference Result 522 states and 802 transitions. [2019-11-26 02:39:34,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:39:34,493 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 82 [2019-11-26 02:39:34,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:34,495 INFO L225 Difference]: With dead ends: 522 [2019-11-26 02:39:34,495 INFO L226 Difference]: Without dead ends: 313 [2019-11-26 02:39:34,497 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:39:34,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2019-11-26 02:39:34,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 258. [2019-11-26 02:39:34,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-26 02:39:34,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 405 transitions. [2019-11-26 02:39:34,507 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 405 transitions. Word has length 82 [2019-11-26 02:39:34,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:34,508 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 405 transitions. [2019-11-26 02:39:34,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:39:34,508 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 405 transitions. [2019-11-26 02:39:34,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-26 02:39:34,509 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:34,509 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:34,509 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:34,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:34,510 INFO L82 PathProgramCache]: Analyzing trace with hash 516042491, now seen corresponding path program 1 times [2019-11-26 02:39:34,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:34,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [998081202] [2019-11-26 02:39:34,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:34,617 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:39:34,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [998081202] [2019-11-26 02:39:34,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:34,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:39:34,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580403120] [2019-11-26 02:39:34,618 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:39:34,618 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:34,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:39:34,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:39:34,619 INFO L87 Difference]: Start difference. First operand 258 states and 405 transitions. Second operand 5 states. [2019-11-26 02:39:35,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:35,130 INFO L93 Difference]: Finished difference Result 606 states and 952 transitions. [2019-11-26 02:39:35,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:39:35,131 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-11-26 02:39:35,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:35,133 INFO L225 Difference]: With dead ends: 606 [2019-11-26 02:39:35,133 INFO L226 Difference]: Without dead ends: 360 [2019-11-26 02:39:35,135 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:39:35,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-11-26 02:39:35,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 258. [2019-11-26 02:39:35,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-26 02:39:35,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 405 transitions. [2019-11-26 02:39:35,145 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 405 transitions. Word has length 82 [2019-11-26 02:39:35,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:35,145 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 405 transitions. [2019-11-26 02:39:35,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:39:35,146 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 405 transitions. [2019-11-26 02:39:35,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-26 02:39:35,147 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:35,147 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:35,147 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:35,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:35,147 INFO L82 PathProgramCache]: Analyzing trace with hash -653395624, now seen corresponding path program 1 times [2019-11-26 02:39:35,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:35,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371668907] [2019-11-26 02:39:35,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:35,209 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:39:35,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371668907] [2019-11-26 02:39:35,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:35,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:39:35,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461620034] [2019-11-26 02:39:35,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:39:35,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:35,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:39:35,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:39:35,212 INFO L87 Difference]: Start difference. First operand 258 states and 405 transitions. Second operand 4 states. [2019-11-26 02:39:35,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:35,749 INFO L93 Difference]: Finished difference Result 589 states and 926 transitions. [2019-11-26 02:39:35,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:39:35,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2019-11-26 02:39:35,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:35,753 INFO L225 Difference]: With dead ends: 589 [2019-11-26 02:39:35,753 INFO L226 Difference]: Without dead ends: 343 [2019-11-26 02:39:35,754 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:39:35,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2019-11-26 02:39:35,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 258. [2019-11-26 02:39:35,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2019-11-26 02:39:35,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 405 transitions. [2019-11-26 02:39:35,766 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 405 transitions. Word has length 83 [2019-11-26 02:39:35,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:35,767 INFO L462 AbstractCegarLoop]: Abstraction has 258 states and 405 transitions. [2019-11-26 02:39:35,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:39:35,767 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 405 transitions. [2019-11-26 02:39:35,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-26 02:39:35,768 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:35,769 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:35,769 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:35,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:35,769 INFO L82 PathProgramCache]: Analyzing trace with hash -69601003, now seen corresponding path program 1 times [2019-11-26 02:39:35,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:35,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649667828] [2019-11-26 02:39:35,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:35,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:35,917 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:39:35,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649667828] [2019-11-26 02:39:35,918 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:35,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:39:35,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493784930] [2019-11-26 02:39:35,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:39:35,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:35,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:39:35,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:39:35,919 INFO L87 Difference]: Start difference. First operand 258 states and 405 transitions. Second operand 5 states. [2019-11-26 02:39:36,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:36,441 INFO L93 Difference]: Finished difference Result 597 states and 940 transitions. [2019-11-26 02:39:36,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:39:36,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-11-26 02:39:36,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:36,444 INFO L225 Difference]: With dead ends: 597 [2019-11-26 02:39:36,444 INFO L226 Difference]: Without dead ends: 351 [2019-11-26 02:39:36,445 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:39:36,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2019-11-26 02:39:36,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 249. [2019-11-26 02:39:36,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-11-26 02:39:36,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 394 transitions. [2019-11-26 02:39:36,455 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 394 transitions. Word has length 83 [2019-11-26 02:39:36,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:36,455 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 394 transitions. [2019-11-26 02:39:36,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:39:36,456 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 394 transitions. [2019-11-26 02:39:36,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-26 02:39:36,457 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:36,457 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:36,457 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:36,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:36,457 INFO L82 PathProgramCache]: Analyzing trace with hash -1739367004, now seen corresponding path program 1 times [2019-11-26 02:39:36,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:36,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287435031] [2019-11-26 02:39:36,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:36,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:36,549 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:39:36,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287435031] [2019-11-26 02:39:36,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:36,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:39:36,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124918232] [2019-11-26 02:39:36,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:39:36,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:36,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:39:36,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:39:36,552 INFO L87 Difference]: Start difference. First operand 249 states and 394 transitions. Second operand 6 states. [2019-11-26 02:39:37,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:37,031 INFO L93 Difference]: Finished difference Result 572 states and 904 transitions. [2019-11-26 02:39:37,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:39:37,032 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-11-26 02:39:37,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:37,034 INFO L225 Difference]: With dead ends: 572 [2019-11-26 02:39:37,034 INFO L226 Difference]: Without dead ends: 335 [2019-11-26 02:39:37,034 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:39:37,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-11-26 02:39:37,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 279. [2019-11-26 02:39:37,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2019-11-26 02:39:37,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 447 transitions. [2019-11-26 02:39:37,044 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 447 transitions. Word has length 98 [2019-11-26 02:39:37,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:37,045 INFO L462 AbstractCegarLoop]: Abstraction has 279 states and 447 transitions. [2019-11-26 02:39:37,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:39:37,045 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 447 transitions. [2019-11-26 02:39:37,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-11-26 02:39:37,046 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:37,046 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:37,046 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:37,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:37,046 INFO L82 PathProgramCache]: Analyzing trace with hash -177894066, now seen corresponding path program 1 times [2019-11-26 02:39:37,046 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:37,046 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126569320] [2019-11-26 02:39:37,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:37,138 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:39:37,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126569320] [2019-11-26 02:39:37,139 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:37,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:39:37,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588696649] [2019-11-26 02:39:37,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:39:37,140 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:37,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:39:37,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:39:37,140 INFO L87 Difference]: Start difference. First operand 279 states and 447 transitions. Second operand 6 states. [2019-11-26 02:39:37,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:37,574 INFO L93 Difference]: Finished difference Result 602 states and 956 transitions. [2019-11-26 02:39:37,574 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:39:37,574 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 103 [2019-11-26 02:39:37,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:37,576 INFO L225 Difference]: With dead ends: 602 [2019-11-26 02:39:37,576 INFO L226 Difference]: Without dead ends: 335 [2019-11-26 02:39:37,577 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:39:37,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2019-11-26 02:39:37,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 284. [2019-11-26 02:39:37,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-11-26 02:39:37,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 456 transitions. [2019-11-26 02:39:37,587 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 456 transitions. Word has length 103 [2019-11-26 02:39:37,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:37,587 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 456 transitions. [2019-11-26 02:39:37,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:39:37,587 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 456 transitions. [2019-11-26 02:39:37,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-26 02:39:37,588 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:37,588 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:37,589 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:37,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:37,589 INFO L82 PathProgramCache]: Analyzing trace with hash 2074462754, now seen corresponding path program 1 times [2019-11-26 02:39:37,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:37,589 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509589239] [2019-11-26 02:39:37,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:37,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:37,676 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:39:37,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509589239] [2019-11-26 02:39:37,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:37,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:39:37,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435814483] [2019-11-26 02:39:37,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:39:37,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:37,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:39:37,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:39:37,679 INFO L87 Difference]: Start difference. First operand 284 states and 456 transitions. Second operand 6 states. [2019-11-26 02:39:38,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:38,251 INFO L93 Difference]: Finished difference Result 605 states and 962 transitions. [2019-11-26 02:39:38,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:39:38,252 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 104 [2019-11-26 02:39:38,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:38,254 INFO L225 Difference]: With dead ends: 605 [2019-11-26 02:39:38,254 INFO L226 Difference]: Without dead ends: 333 [2019-11-26 02:39:38,255 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:39:38,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2019-11-26 02:39:38,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 285. [2019-11-26 02:39:38,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-11-26 02:39:38,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 457 transitions. [2019-11-26 02:39:38,268 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 457 transitions. Word has length 104 [2019-11-26 02:39:38,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:38,268 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 457 transitions. [2019-11-26 02:39:38,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:39:38,269 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 457 transitions. [2019-11-26 02:39:38,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2019-11-26 02:39:38,270 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:38,270 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:38,270 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:38,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:38,270 INFO L82 PathProgramCache]: Analyzing trace with hash -2106706963, now seen corresponding path program 1 times [2019-11-26 02:39:38,271 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:38,271 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810396675] [2019-11-26 02:39:38,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:38,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:38,397 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:39:38,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810396675] [2019-11-26 02:39:38,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:38,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-26 02:39:38,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041393393] [2019-11-26 02:39:38,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:39:38,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:38,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:39:38,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:39:38,401 INFO L87 Difference]: Start difference. First operand 285 states and 457 transitions. Second operand 6 states. [2019-11-26 02:39:38,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:38,965 INFO L93 Difference]: Finished difference Result 601 states and 955 transitions. [2019-11-26 02:39:38,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:39:38,966 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 109 [2019-11-26 02:39:38,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:38,968 INFO L225 Difference]: With dead ends: 601 [2019-11-26 02:39:38,968 INFO L226 Difference]: Without dead ends: 328 [2019-11-26 02:39:38,969 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:39:38,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2019-11-26 02:39:38,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 288. [2019-11-26 02:39:38,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-11-26 02:39:38,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 460 transitions. [2019-11-26 02:39:38,982 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 460 transitions. Word has length 109 [2019-11-26 02:39:38,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:38,982 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 460 transitions. [2019-11-26 02:39:38,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:39:38,982 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 460 transitions. [2019-11-26 02:39:38,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-26 02:39:38,983 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:38,983 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:38,984 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:38,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:38,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1719423535, now seen corresponding path program 1 times [2019-11-26 02:39:38,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:38,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428896674] [2019-11-26 02:39:38,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:39,066 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:39:39,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428896674] [2019-11-26 02:39:39,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:39,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:39:39,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172186521] [2019-11-26 02:39:39,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:39:39,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:39,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:39:39,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:39:39,068 INFO L87 Difference]: Start difference. First operand 288 states and 460 transitions. Second operand 4 states. [2019-11-26 02:39:39,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:39,369 INFO L93 Difference]: Finished difference Result 600 states and 952 transitions. [2019-11-26 02:39:39,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:39:39,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-11-26 02:39:39,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:39,371 INFO L225 Difference]: With dead ends: 600 [2019-11-26 02:39:39,371 INFO L226 Difference]: Without dead ends: 324 [2019-11-26 02:39:39,372 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:39:39,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2019-11-26 02:39:39,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 288. [2019-11-26 02:39:39,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-11-26 02:39:39,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 459 transitions. [2019-11-26 02:39:39,381 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 459 transitions. Word has length 110 [2019-11-26 02:39:39,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:39,381 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 459 transitions. [2019-11-26 02:39:39,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:39:39,382 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 459 transitions. [2019-11-26 02:39:39,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-26 02:39:39,382 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:39,383 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:39,383 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:39,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:39,383 INFO L82 PathProgramCache]: Analyzing trace with hash 41205130, now seen corresponding path program 1 times [2019-11-26 02:39:39,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:39,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704506874] [2019-11-26 02:39:39,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:39,457 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:39:39,458 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704506874] [2019-11-26 02:39:39,458 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:39,458 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:39:39,458 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431047359] [2019-11-26 02:39:39,459 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:39:39,459 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:39,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:39:39,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:39:39,459 INFO L87 Difference]: Start difference. First operand 288 states and 459 transitions. Second operand 4 states. [2019-11-26 02:39:39,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:39,920 INFO L93 Difference]: Finished difference Result 646 states and 1029 transitions. [2019-11-26 02:39:39,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:39:39,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-11-26 02:39:39,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:39,923 INFO L225 Difference]: With dead ends: 646 [2019-11-26 02:39:39,923 INFO L226 Difference]: Without dead ends: 370 [2019-11-26 02:39:39,924 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:39:39,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2019-11-26 02:39:39,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 318. [2019-11-26 02:39:39,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-11-26 02:39:39,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 512 transitions. [2019-11-26 02:39:39,936 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 512 transitions. Word has length 110 [2019-11-26 02:39:39,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:39,936 INFO L462 AbstractCegarLoop]: Abstraction has 318 states and 512 transitions. [2019-11-26 02:39:39,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:39:39,936 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 512 transitions. [2019-11-26 02:39:39,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-11-26 02:39:39,937 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:39,938 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:39,938 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:39,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:39,938 INFO L82 PathProgramCache]: Analyzing trace with hash 2037632941, now seen corresponding path program 1 times [2019-11-26 02:39:39,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:39,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439888407] [2019-11-26 02:39:39,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:39,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:40,038 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:39:40,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439888407] [2019-11-26 02:39:40,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:40,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:39:40,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314449848] [2019-11-26 02:39:40,040 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:39:40,040 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:40,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:39:40,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:39:40,040 INFO L87 Difference]: Start difference. First operand 318 states and 512 transitions. Second operand 5 states. [2019-11-26 02:39:40,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:40,537 INFO L93 Difference]: Finished difference Result 760 states and 1228 transitions. [2019-11-26 02:39:40,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:39:40,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 110 [2019-11-26 02:39:40,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:40,539 INFO L225 Difference]: With dead ends: 760 [2019-11-26 02:39:40,539 INFO L226 Difference]: Without dead ends: 454 [2019-11-26 02:39:40,540 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:39:40,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2019-11-26 02:39:40,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 348. [2019-11-26 02:39:40,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-11-26 02:39:40,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 565 transitions. [2019-11-26 02:39:40,552 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 565 transitions. Word has length 110 [2019-11-26 02:39:40,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:40,553 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 565 transitions. [2019-11-26 02:39:40,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:39:40,553 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 565 transitions. [2019-11-26 02:39:40,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-26 02:39:40,554 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:40,554 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:40,554 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:40,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:40,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1895828766, now seen corresponding path program 1 times [2019-11-26 02:39:40,555 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:40,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130919287] [2019-11-26 02:39:40,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:40,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:40,628 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:39:40,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130919287] [2019-11-26 02:39:40,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:40,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:39:40,629 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964831821] [2019-11-26 02:39:40,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:39:40,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:40,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:39:40,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:39:40,630 INFO L87 Difference]: Start difference. First operand 348 states and 565 transitions. Second operand 4 states. [2019-11-26 02:39:40,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:40,974 INFO L93 Difference]: Finished difference Result 718 states and 1160 transitions. [2019-11-26 02:39:40,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:39:40,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-11-26 02:39:40,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:40,976 INFO L225 Difference]: With dead ends: 718 [2019-11-26 02:39:40,976 INFO L226 Difference]: Without dead ends: 382 [2019-11-26 02:39:40,976 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:39:40,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2019-11-26 02:39:40,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 348. [2019-11-26 02:39:40,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2019-11-26 02:39:40,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 564 transitions. [2019-11-26 02:39:40,987 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 564 transitions. Word has length 111 [2019-11-26 02:39:40,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:40,988 INFO L462 AbstractCegarLoop]: Abstraction has 348 states and 564 transitions. [2019-11-26 02:39:40,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:39:40,988 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 564 transitions. [2019-11-26 02:39:40,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-26 02:39:40,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:40,989 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:40,990 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:40,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:40,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1556229416, now seen corresponding path program 1 times [2019-11-26 02:39:40,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:40,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266004181] [2019-11-26 02:39:40,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:41,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:41,063 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:39:41,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266004181] [2019-11-26 02:39:41,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:41,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:39:41,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550885917] [2019-11-26 02:39:41,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:39:41,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:41,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:39:41,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:39:41,065 INFO L87 Difference]: Start difference. First operand 348 states and 564 transitions. Second operand 4 states. [2019-11-26 02:39:41,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:41,477 INFO L93 Difference]: Finished difference Result 766 states and 1238 transitions. [2019-11-26 02:39:41,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:39:41,477 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2019-11-26 02:39:41,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:41,480 INFO L225 Difference]: With dead ends: 766 [2019-11-26 02:39:41,480 INFO L226 Difference]: Without dead ends: 430 [2019-11-26 02:39:41,481 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:39:41,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2019-11-26 02:39:41,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 383. [2019-11-26 02:39:41,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-11-26 02:39:41,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 626 transitions. [2019-11-26 02:39:41,496 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 626 transitions. Word has length 115 [2019-11-26 02:39:41,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:41,496 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 626 transitions. [2019-11-26 02:39:41,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:39:41,496 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 626 transitions. [2019-11-26 02:39:41,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-26 02:39:41,498 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:41,498 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:41,498 INFO L410 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:41,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:41,499 INFO L82 PathProgramCache]: Analyzing trace with hash 1612183781, now seen corresponding path program 1 times [2019-11-26 02:39:41,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:41,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684351410] [2019-11-26 02:39:41,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:41,631 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:39:41,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684351410] [2019-11-26 02:39:41,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:41,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:39:41,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270494604] [2019-11-26 02:39:41,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:39:41,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:41,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:39:41,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:39:41,633 INFO L87 Difference]: Start difference. First operand 383 states and 626 transitions. Second operand 5 states. [2019-11-26 02:39:42,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:42,032 INFO L93 Difference]: Finished difference Result 856 states and 1391 transitions. [2019-11-26 02:39:42,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:39:42,032 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 115 [2019-11-26 02:39:42,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:42,035 INFO L225 Difference]: With dead ends: 856 [2019-11-26 02:39:42,035 INFO L226 Difference]: Without dead ends: 485 [2019-11-26 02:39:42,036 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:39:42,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2019-11-26 02:39:42,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 383. [2019-11-26 02:39:42,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-11-26 02:39:42,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 625 transitions. [2019-11-26 02:39:42,049 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 625 transitions. Word has length 115 [2019-11-26 02:39:42,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:42,050 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 625 transitions. [2019-11-26 02:39:42,050 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:39:42,050 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 625 transitions. [2019-11-26 02:39:42,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-26 02:39:42,051 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:42,051 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:42,051 INFO L410 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:42,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:42,052 INFO L82 PathProgramCache]: Analyzing trace with hash -2284152, now seen corresponding path program 1 times [2019-11-26 02:39:42,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:42,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046784657] [2019-11-26 02:39:42,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:42,121 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:39:42,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046784657] [2019-11-26 02:39:42,122 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:42,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:39:42,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287606749] [2019-11-26 02:39:42,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:39:42,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:42,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:39:42,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:39:42,123 INFO L87 Difference]: Start difference. First operand 383 states and 625 transitions. Second operand 4 states. [2019-11-26 02:39:42,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:42,612 INFO L93 Difference]: Finished difference Result 834 states and 1357 transitions. [2019-11-26 02:39:42,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:39:42,613 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-11-26 02:39:42,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:42,615 INFO L225 Difference]: With dead ends: 834 [2019-11-26 02:39:42,616 INFO L226 Difference]: Without dead ends: 463 [2019-11-26 02:39:42,616 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:39:42,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-11-26 02:39:42,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 419. [2019-11-26 02:39:42,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2019-11-26 02:39:42,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 688 transitions. [2019-11-26 02:39:42,631 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 688 transitions. Word has length 116 [2019-11-26 02:39:42,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:42,631 INFO L462 AbstractCegarLoop]: Abstraction has 419 states and 688 transitions. [2019-11-26 02:39:42,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:39:42,632 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 688 transitions. [2019-11-26 02:39:42,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-26 02:39:42,633 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:42,633 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:42,633 INFO L410 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:42,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:42,634 INFO L82 PathProgramCache]: Analyzing trace with hash 1732301163, now seen corresponding path program 1 times [2019-11-26 02:39:42,634 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:42,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79534405] [2019-11-26 02:39:42,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:42,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:42,733 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:39:42,734 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79534405] [2019-11-26 02:39:42,734 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:42,734 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:39:42,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298709446] [2019-11-26 02:39:42,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:39:42,735 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:42,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:39:42,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:39:42,735 INFO L87 Difference]: Start difference. First operand 419 states and 688 transitions. Second operand 5 states. [2019-11-26 02:39:43,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:43,243 INFO L93 Difference]: Finished difference Result 890 states and 1448 transitions. [2019-11-26 02:39:43,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:39:43,244 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 116 [2019-11-26 02:39:43,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:43,246 INFO L225 Difference]: With dead ends: 890 [2019-11-26 02:39:43,246 INFO L226 Difference]: Without dead ends: 483 [2019-11-26 02:39:43,247 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:39:43,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-11-26 02:39:43,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 383. [2019-11-26 02:39:43,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-11-26 02:39:43,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 623 transitions. [2019-11-26 02:39:43,261 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 623 transitions. Word has length 116 [2019-11-26 02:39:43,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:43,261 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 623 transitions. [2019-11-26 02:39:43,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:39:43,262 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 623 transitions. [2019-11-26 02:39:43,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-26 02:39:43,263 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:43,263 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:43,264 INFO L410 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:43,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:43,264 INFO L82 PathProgramCache]: Analyzing trace with hash -5896121, now seen corresponding path program 1 times [2019-11-26 02:39:43,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:43,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872614049] [2019-11-26 02:39:43,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:43,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:43,328 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:39:43,328 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872614049] [2019-11-26 02:39:43,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:39:43,329 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:39:43,329 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178541206] [2019-11-26 02:39:43,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:39:43,330 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:39:43,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:39:43,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:39:43,330 INFO L87 Difference]: Start difference. First operand 383 states and 623 transitions. Second operand 4 states. [2019-11-26 02:39:43,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:39:43,685 INFO L93 Difference]: Finished difference Result 834 states and 1352 transitions. [2019-11-26 02:39:43,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:39:43,686 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2019-11-26 02:39:43,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:39:43,688 INFO L225 Difference]: With dead ends: 834 [2019-11-26 02:39:43,688 INFO L226 Difference]: Without dead ends: 463 [2019-11-26 02:39:43,690 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:39:43,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2019-11-26 02:39:43,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 424. [2019-11-26 02:39:43,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-11-26 02:39:43,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 693 transitions. [2019-11-26 02:39:43,706 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 693 transitions. Word has length 121 [2019-11-26 02:39:43,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:39:43,707 INFO L462 AbstractCegarLoop]: Abstraction has 424 states and 693 transitions. [2019-11-26 02:39:43,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:39:43,707 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 693 transitions. [2019-11-26 02:39:43,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-26 02:39:43,708 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:39:43,709 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:39:43,709 INFO L410 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:39:43,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:39:43,709 INFO L82 PathProgramCache]: Analyzing trace with hash 238113348, now seen corresponding path program 1 times [2019-11-26 02:39:43,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:39:43,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075595533] [2019-11-26 02:39:43,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:39:43,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:43,927 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 96 proven. 1 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-11-26 02:39:43,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075595533] [2019-11-26 02:39:43,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431923722] [2019-11-26 02:39:43,928 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c2433536-9daf-416b-9004-071c2ded8e98/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:39:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:39:44,123 INFO L255 TraceCheckSpWp]: Trace formula consists of 581 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-26 02:39:44,142 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:39:44,242 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_323|, |v_#memory_$Pointer$.base_323|], 5=[|v_#memory_int_323|]} [2019-11-26 02:39:44,273 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:39:44,283 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:39:44,288 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:39:44,292 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:39:44,292 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:39:44,300 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:39:44,361 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:39:44,361 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:39:44,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:39:44,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:39:44,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:39:44,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:39:44,374 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:39:44,376 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:39:44,378 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:39:44,380 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:39:44,381 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-26 02:39:44,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:39:44,384 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:39:44,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:39:44,388 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:39:44,598 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:39:44,598 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:39:44,602 INFO L168 Benchmark]: Toolchain (without parser) took 23513.86 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 460.8 MB). Free memory was 944.7 MB in the beginning and 1.4 GB in the end (delta: -472.1 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:39:44,602 INFO L168 Benchmark]: CDTParser took 0.32 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:39:44,603 INFO L168 Benchmark]: CACSL2BoogieTranslator took 762.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -164.1 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:39:44,603 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:39:44,604 INFO L168 Benchmark]: Boogie Preprocessor took 135.29 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:39:44,604 INFO L168 Benchmark]: RCFGBuilder took 2028.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 919.0 MB in the end (delta: 179.1 MB). Peak memory consumption was 179.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:39:44,604 INFO L168 Benchmark]: TraceAbstraction took 20499.44 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 323.5 MB). Free memory was 919.0 MB in the beginning and 1.4 GB in the end (delta: -497.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:39:44,606 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.32 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 762.32 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -164.1 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 135.29 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2028.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 919.0 MB in the end (delta: 179.1 MB). Peak memory consumption was 179.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 20499.44 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 323.5 MB). Free memory was 919.0 MB in the beginning and 1.4 GB in the end (delta: -497.8 MB). There was no memory consumed. 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:39:46,537 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:39:46,539 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:39:46,554 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:39:46,555 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:39:46,556 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:39:46,558 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:39:46,570 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:39:46,572 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:39:46,574 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:39:46,575 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:39:46,577 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:39:46,577 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:39:46,581 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:39:46,583 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:39:46,585 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:39:46,586 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:39:46,588 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:39:46,591 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:39:46,595 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:39:46,599 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:39:46,602 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:39:46,603 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:39:46,605 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:39:46,609 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:39:46,609 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:39:46,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:39:46,611 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:39:46,611 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:39:46,612 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:39:46,613 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:39:46,614 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:39:46,614 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:39:46,615 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:39:46,616 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:39:46,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:39:46,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:39:46,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:39:46,618 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:39:46,620 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:39:46,621 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:39:46,622 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c2433536-9daf-416b-9004-071c2ded8e98/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-11-26 02:39:46,640 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:39:46,640 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:39:46,641 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:39:46,641 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:39:46,642 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:39:46,642 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:39:46,642 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:39:46,643 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:39:46,643 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:39:46,644 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:39:46,645 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:39:46,645 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:39:46,645 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:39:46,646 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:39:46,646 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:39:46,646 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:39:46,647 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 02:39:46,647 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-26 02:39:46,647 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-26 02:39:46,647 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:39:46,648 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:39:46,648 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 02:39:46,648 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:39:46,648 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:39:46,649 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 02:39:46,649 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:39:46,649 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:39:46,649 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:39:46,650 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:39:46,650 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:39:46,650 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:39:46,650 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-11-26 02:39:46,651 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-26 02:39:46,651 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:39:46,651 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:39:46,652 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_c2433536-9daf-416b-9004-071c2ded8e98/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 -> 5d1ed5f95c4e8acd6cf76ffe908c8c8bb3dc8352 [2019-11-26 02:39:46,934 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:39:46,944 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:39:46,948 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:39:46,949 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:39:46,949 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:39:46,950 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c2433536-9daf-416b-9004-071c2ded8e98/bin/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.16.i.cil-1.c [2019-11-26 02:39:47,001 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c2433536-9daf-416b-9004-071c2ded8e98/bin/utaipan/data/b6e4ba533/519d829ee35a4a6ca116b7e0c0150854/FLAG5cce229bc [2019-11-26 02:39:47,536 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:39:47,537 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c2433536-9daf-416b-9004-071c2ded8e98/sv-benchmarks/c/ssh/s3_srvr.blast.16.i.cil-1.c [2019-11-26 02:39:47,563 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c2433536-9daf-416b-9004-071c2ded8e98/bin/utaipan/data/b6e4ba533/519d829ee35a4a6ca116b7e0c0150854/FLAG5cce229bc [2019-11-26 02:39:47,827 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c2433536-9daf-416b-9004-071c2ded8e98/bin/utaipan/data/b6e4ba533/519d829ee35a4a6ca116b7e0c0150854 [2019-11-26 02:39:47,830 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:39:47,831 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:39:47,832 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:39:47,832 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:39:47,835 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:39:47,835 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:39:47" (1/1) ... [2019-11-26 02:39:47,838 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b9d0dec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:39:47, skipping insertion in model container [2019-11-26 02:39:47,838 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:39:47" (1/1) ... [2019-11-26 02:39:47,845 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:39:47,917 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:39:48,290 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:39:48,296 INFO L968 CHandler]: at location: C: (SSL_METHOD *)((void *)0) [1038] [2019-11-26 02:39:48,296 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-26 02:39:48,337 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:39:48,348 INFO L168 Benchmark]: Toolchain (without parser) took 515.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 952.4 MB in the beginning and 1.2 GB in the end (delta: -203.8 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. [2019-11-26 02:39:48,349 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:39:48,351 INFO L168 Benchmark]: CACSL2BoogieTranslator took 513.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 952.4 MB in the beginning and 1.2 GB in the end (delta: -203.8 MB). Peak memory consumption was 29.6 MB. Max. memory is 11.5 GB. [2019-11-26 02:39:48,353 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 513.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 167.8 MB). Free memory was 952.4 MB in the beginning and 1.2 GB in the end (delta: -203.8 MB). Peak memory consumption was 29.6 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...