./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.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_1f6c7238-d0cc-4eac-9c1c-3bb2e44d498a/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1f6c7238-d0cc-4eac-9c1c-3bb2e44d498a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1f6c7238-d0cc-4eac-9c1c-3bb2e44d498a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1f6c7238-d0cc-4eac-9c1c-3bb2e44d498a/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1f6c7238-d0cc-4eac-9c1c-3bb2e44d498a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1f6c7238-d0cc-4eac-9c1c-3bb2e44d498a/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 a85198d3f93b8c751f2c6e712deab62f97c1022f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_1f6c7238-d0cc-4eac-9c1c-3bb2e44d498a/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1f6c7238-d0cc-4eac-9c1c-3bb2e44d498a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1f6c7238-d0cc-4eac-9c1c-3bb2e44d498a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1f6c7238-d0cc-4eac-9c1c-3bb2e44d498a/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1f6c7238-d0cc-4eac-9c1c-3bb2e44d498a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1f6c7238-d0cc-4eac-9c1c-3bb2e44d498a/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 a85198d3f93b8c751f2c6e712deab62f97c1022f ................................................................................................................................................................... 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:57:44,721 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:57:44,723 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:57:44,738 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:57:44,738 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:57:44,739 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:57:44,741 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:57:44,749 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:57:44,754 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:57:44,758 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:57:44,759 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:57:44,760 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:57:44,760 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:57:44,762 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:57:44,763 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:57:44,764 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:57:44,765 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:57:44,766 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:57:44,768 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:57:44,771 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:57:44,775 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:57:44,778 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:57:44,779 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:57:44,779 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:57:44,783 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:57:44,783 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:57:44,783 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:57:44,784 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:57:44,785 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:57:44,785 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:57:44,786 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:57:44,786 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:57:44,787 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:57:44,788 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:57:44,788 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:57:44,788 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:57:44,789 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:57:44,789 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:57:44,789 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:57:44,790 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:57:44,791 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:57:44,792 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1f6c7238-d0cc-4eac-9c1c-3bb2e44d498a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:57:44,816 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:57:44,816 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:57:44,817 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:57:44,817 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:57:44,817 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:57:44,817 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:57:44,817 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:57:44,818 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:57:44,818 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:57:44,818 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:57:44,818 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:57:44,818 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:57:44,819 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:57:44,819 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:57:44,819 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:57:44,819 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:57:44,820 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:57:44,820 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:57:44,820 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:57:44,820 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:57:44,820 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:57:44,821 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:57:44,821 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:57:44,821 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:57:44,821 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:57:44,821 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:57:44,821 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:57:44,822 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:57:44,822 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:57:44,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:57:44,822 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:57:44,822 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:57:44,823 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:57:44,823 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:57:44,823 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:57:44,823 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:57:44,823 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:57:44,823 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_1f6c7238-d0cc-4eac-9c1c-3bb2e44d498a/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 -> a85198d3f93b8c751f2c6e712deab62f97c1022f [2019-11-26 02:57:45,012 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:57:45,026 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:57:45,029 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:57:45,031 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:57:45,032 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:57:45,032 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1f6c7238-d0cc-4eac-9c1c-3bb2e44d498a/bin/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-11-26 02:57:45,092 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1f6c7238-d0cc-4eac-9c1c-3bb2e44d498a/bin/utaipan/data/859619b49/2ac19aebb00a48fda98504b7381e55d2/FLAG077dc728c [2019-11-26 02:57:45,600 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:57:45,600 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1f6c7238-d0cc-4eac-9c1c-3bb2e44d498a/sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-11-26 02:57:45,619 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1f6c7238-d0cc-4eac-9c1c-3bb2e44d498a/bin/utaipan/data/859619b49/2ac19aebb00a48fda98504b7381e55d2/FLAG077dc728c [2019-11-26 02:57:46,105 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1f6c7238-d0cc-4eac-9c1c-3bb2e44d498a/bin/utaipan/data/859619b49/2ac19aebb00a48fda98504b7381e55d2 [2019-11-26 02:57:46,107 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:57:46,109 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:57:46,110 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:57:46,110 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:57:46,113 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:57:46,114 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:57:46" (1/1) ... [2019-11-26 02:57:46,116 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37b83b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:46, skipping insertion in model container [2019-11-26 02:57:46,117 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:57:46" (1/1) ... [2019-11-26 02:57:46,123 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:57:46,176 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:57:46,729 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:57:46,745 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:57:46,886 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:57:46,925 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:57:46,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:46 WrapperNode [2019-11-26 02:57:46,925 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:57:46,926 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:57:46,926 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:57:46,926 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:57:46,934 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:57:46" (1/1) ... [2019-11-26 02:57:46,974 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:57:46" (1/1) ... [2019-11-26 02:57:47,041 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:57:47,041 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:57:47,041 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:57:47,041 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:57:47,058 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:46" (1/1) ... [2019-11-26 02:57:47,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:46" (1/1) ... [2019-11-26 02:57:47,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:46" (1/1) ... [2019-11-26 02:57:47,078 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:46" (1/1) ... [2019-11-26 02:57:47,140 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:46" (1/1) ... [2019-11-26 02:57:47,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:46" (1/1) ... [2019-11-26 02:57:47,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:46" (1/1) ... [2019-11-26 02:57:47,169 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:57:47,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:57:47,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:57:47,170 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:57:47,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f6c7238-d0cc-4eac-9c1c-3bb2e44d498a/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:57:47,250 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-26 02:57:47,252 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-26 02:57:47,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 02:57:47,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-26 02:57:47,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-26 02:57:47,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-26 02:57:47,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-26 02:57:47,254 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 02:57:47,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:57:47,254 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:57:47,408 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 02:57:48,377 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-26 02:57:48,377 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-26 02:57:49,105 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:57:49,105 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:57:49,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:57:49 BoogieIcfgContainer [2019-11-26 02:57:49,106 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:57:49,107 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:57:49,108 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:57:49,110 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:57:49,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:57:46" (1/3) ... [2019-11-26 02:57:49,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bde061c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:57:49, skipping insertion in model container [2019-11-26 02:57:49,111 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:57:46" (2/3) ... [2019-11-26 02:57:49,112 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bde061c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:57:49, skipping insertion in model container [2019-11-26 02:57:49,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:57:49" (3/3) ... [2019-11-26 02:57:49,115 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.04.i.cil.c [2019-11-26 02:57:49,125 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:57:49,132 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:57:49,143 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:57:49,166 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:57:49,166 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:57:49,167 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:57:49,167 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:57:49,167 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:57:49,167 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:57:49,167 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:57:49,167 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:57:49,190 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2019-11-26 02:57:49,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-26 02:57:49,198 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:49,198 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:57:49,199 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:49,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:49,203 INFO L82 PathProgramCache]: Analyzing trace with hash 1249822337, now seen corresponding path program 1 times [2019-11-26 02:57:49,210 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:49,210 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989880193] [2019-11-26 02:57:49,211 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:49,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:49,559 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:57:49,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989880193] [2019-11-26 02:57:49,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:49,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:57:49,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50268302] [2019-11-26 02:57:49,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:49,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:49,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:49,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:49,584 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 4 states. [2019-11-26 02:57:50,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:50,061 INFO L93 Difference]: Finished difference Result 239 states and 412 transitions. [2019-11-26 02:57:50,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:50,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-11-26 02:57:50,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:50,087 INFO L225 Difference]: With dead ends: 239 [2019-11-26 02:57:50,087 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:57:50,091 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:57:50,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:57:50,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-26 02:57:50,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:57:50,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 175 transitions. [2019-11-26 02:57:50,151 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 175 transitions. Word has length 39 [2019-11-26 02:57:50,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:50,152 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 175 transitions. [2019-11-26 02:57:50,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:50,152 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 175 transitions. [2019-11-26 02:57:50,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-26 02:57:50,156 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:50,157 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, 1, 1] [2019-11-26 02:57:50,157 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:50,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:50,207 INFO L82 PathProgramCache]: Analyzing trace with hash 1393512576, now seen corresponding path program 1 times [2019-11-26 02:57:50,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:50,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964850076] [2019-11-26 02:57:50,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:50,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:50,366 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:57:50,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964850076] [2019-11-26 02:57:50,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:50,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:57:50,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986150295] [2019-11-26 02:57:50,369 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:50,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:50,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:50,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:50,371 INFO L87 Difference]: Start difference. First operand 115 states and 175 transitions. Second operand 4 states. [2019-11-26 02:57:50,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:50,721 INFO L93 Difference]: Finished difference Result 230 states and 344 transitions. [2019-11-26 02:57:50,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:50,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2019-11-26 02:57:50,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:50,724 INFO L225 Difference]: With dead ends: 230 [2019-11-26 02:57:50,724 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:57:50,725 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:57:50,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:57:50,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-26 02:57:50,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:57:50,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 174 transitions. [2019-11-26 02:57:50,744 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 174 transitions. Word has length 49 [2019-11-26 02:57:50,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:50,745 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 174 transitions. [2019-11-26 02:57:50,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:50,745 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 174 transitions. [2019-11-26 02:57:50,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-26 02:57:50,749 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:50,749 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, 1, 1] [2019-11-26 02:57:50,750 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:50,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:50,753 INFO L82 PathProgramCache]: Analyzing trace with hash -1220619832, now seen corresponding path program 1 times [2019-11-26 02:57:50,754 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:50,754 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666983242] [2019-11-26 02:57:50,754 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:50,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:50,864 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:57:50,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666983242] [2019-11-26 02:57:50,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:50,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:57:50,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024514077] [2019-11-26 02:57:50,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:50,865 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:50,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:50,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:50,866 INFO L87 Difference]: Start difference. First operand 115 states and 174 transitions. Second operand 4 states. [2019-11-26 02:57:51,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:51,159 INFO L93 Difference]: Finished difference Result 230 states and 343 transitions. [2019-11-26 02:57:51,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:51,160 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-26 02:57:51,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:51,161 INFO L225 Difference]: With dead ends: 230 [2019-11-26 02:57:51,161 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:57:51,162 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:57:51,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:57:51,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-26 02:57:51,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:57:51,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 173 transitions. [2019-11-26 02:57:51,171 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 173 transitions. Word has length 50 [2019-11-26 02:57:51,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:51,171 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 173 transitions. [2019-11-26 02:57:51,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:51,172 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 173 transitions. [2019-11-26 02:57:51,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-26 02:57:51,174 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:51,174 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, 1, 1] [2019-11-26 02:57:51,174 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:51,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:51,175 INFO L82 PathProgramCache]: Analyzing trace with hash 1232176335, now seen corresponding path program 1 times [2019-11-26 02:57:51,175 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:51,175 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272392490] [2019-11-26 02:57:51,175 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:51,228 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:57:51,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272392490] [2019-11-26 02:57:51,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:51,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:57:51,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637942324] [2019-11-26 02:57:51,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:51,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:51,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:51,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:51,230 INFO L87 Difference]: Start difference. First operand 115 states and 173 transitions. Second operand 4 states. [2019-11-26 02:57:51,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:51,478 INFO L93 Difference]: Finished difference Result 230 states and 342 transitions. [2019-11-26 02:57:51,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:51,479 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-26 02:57:51,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:51,480 INFO L225 Difference]: With dead ends: 230 [2019-11-26 02:57:51,481 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:57:51,482 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:57:51,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:57:51,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-26 02:57:51,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:57:51,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 172 transitions. [2019-11-26 02:57:51,492 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 172 transitions. Word has length 51 [2019-11-26 02:57:51,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:51,492 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 172 transitions. [2019-11-26 02:57:51,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:51,493 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 172 transitions. [2019-11-26 02:57:51,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-26 02:57:51,494 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:51,495 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, 1, 1] [2019-11-26 02:57:51,495 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:51,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:51,495 INFO L82 PathProgramCache]: Analyzing trace with hash 325809389, now seen corresponding path program 1 times [2019-11-26 02:57:51,495 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:51,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643241803] [2019-11-26 02:57:51,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:51,550 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:57:51,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643241803] [2019-11-26 02:57:51,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:51,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:57:51,551 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902601023] [2019-11-26 02:57:51,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:51,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:51,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:51,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:51,552 INFO L87 Difference]: Start difference. First operand 115 states and 172 transitions. Second operand 4 states. [2019-11-26 02:57:51,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:51,839 INFO L93 Difference]: Finished difference Result 230 states and 341 transitions. [2019-11-26 02:57:51,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:51,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-26 02:57:51,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:51,841 INFO L225 Difference]: With dead ends: 230 [2019-11-26 02:57:51,841 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:57:51,842 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:57:51,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:57:51,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-26 02:57:51,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:57:51,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 171 transitions. [2019-11-26 02:57:51,857 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 171 transitions. Word has length 51 [2019-11-26 02:57:51,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:51,859 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 171 transitions. [2019-11-26 02:57:51,859 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:51,859 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 171 transitions. [2019-11-26 02:57:51,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-26 02:57:51,864 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:51,865 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, 1, 1] [2019-11-26 02:57:51,865 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:51,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:51,866 INFO L82 PathProgramCache]: Analyzing trace with hash -765211748, now seen corresponding path program 1 times [2019-11-26 02:57:51,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:51,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247296713] [2019-11-26 02:57:51,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:51,912 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:57:51,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247296713] [2019-11-26 02:57:51,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:51,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:57:51,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963195202] [2019-11-26 02:57:51,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:51,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:51,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:51,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:51,914 INFO L87 Difference]: Start difference. First operand 115 states and 171 transitions. Second operand 4 states. [2019-11-26 02:57:52,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:52,183 INFO L93 Difference]: Finished difference Result 230 states and 340 transitions. [2019-11-26 02:57:52,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:52,188 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-26 02:57:52,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:52,189 INFO L225 Difference]: With dead ends: 230 [2019-11-26 02:57:52,189 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:57:52,190 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:57:52,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:57:52,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-26 02:57:52,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:57:52,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 170 transitions. [2019-11-26 02:57:52,196 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 170 transitions. Word has length 51 [2019-11-26 02:57:52,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:52,196 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 170 transitions. [2019-11-26 02:57:52,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:52,196 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 170 transitions. [2019-11-26 02:57:52,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-26 02:57:52,197 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:52,197 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, 1, 1] [2019-11-26 02:57:52,198 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:52,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:52,198 INFO L82 PathProgramCache]: Analyzing trace with hash -1662323005, now seen corresponding path program 1 times [2019-11-26 02:57:52,198 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:52,198 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807606294] [2019-11-26 02:57:52,198 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:52,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:52,250 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:57:52,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807606294] [2019-11-26 02:57:52,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:52,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:57:52,250 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516506611] [2019-11-26 02:57:52,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:52,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:52,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:52,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:52,251 INFO L87 Difference]: Start difference. First operand 115 states and 170 transitions. Second operand 4 states. [2019-11-26 02:57:52,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:52,506 INFO L93 Difference]: Finished difference Result 230 states and 339 transitions. [2019-11-26 02:57:52,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:52,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-26 02:57:52,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:52,508 INFO L225 Difference]: With dead ends: 230 [2019-11-26 02:57:52,508 INFO L226 Difference]: Without dead ends: 127 [2019-11-26 02:57:52,509 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:57:52,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-26 02:57:52,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2019-11-26 02:57:52,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:57:52,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 169 transitions. [2019-11-26 02:57:52,514 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 169 transitions. Word has length 52 [2019-11-26 02:57:52,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:52,515 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 169 transitions. [2019-11-26 02:57:52,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:52,515 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 169 transitions. [2019-11-26 02:57:52,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-26 02:57:52,516 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:52,516 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, 1, 1] [2019-11-26 02:57:52,516 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:52,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:52,517 INFO L82 PathProgramCache]: Analyzing trace with hash -1259475962, now seen corresponding path program 1 times [2019-11-26 02:57:52,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:52,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887074253] [2019-11-26 02:57:52,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:52,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:52,568 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:57:52,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887074253] [2019-11-26 02:57:52,568 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:52,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:57:52,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593695437] [2019-11-26 02:57:52,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:52,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:52,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:52,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:52,570 INFO L87 Difference]: Start difference. First operand 115 states and 169 transitions. Second operand 4 states. [2019-11-26 02:57:52,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:52,853 INFO L93 Difference]: Finished difference Result 228 states and 336 transitions. [2019-11-26 02:57:52,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:52,854 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-26 02:57:52,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:52,855 INFO L225 Difference]: With dead ends: 228 [2019-11-26 02:57:52,855 INFO L226 Difference]: Without dead ends: 125 [2019-11-26 02:57:52,856 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:57:52,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2019-11-26 02:57:52,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 115. [2019-11-26 02:57:52,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:57:52,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 168 transitions. [2019-11-26 02:57:52,860 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 168 transitions. Word has length 52 [2019-11-26 02:57:52,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:52,860 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 168 transitions. [2019-11-26 02:57:52,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:52,861 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 168 transitions. [2019-11-26 02:57:52,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-26 02:57:52,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:52,862 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, 1, 1] [2019-11-26 02:57:52,862 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:52,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:52,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1475708778, now seen corresponding path program 1 times [2019-11-26 02:57:52,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:52,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904395866] [2019-11-26 02:57:52,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:52,909 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:57:52,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904395866] [2019-11-26 02:57:52,910 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:52,910 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:57:52,910 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099408894] [2019-11-26 02:57:52,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:52,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:52,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:52,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:52,911 INFO L87 Difference]: Start difference. First operand 115 states and 168 transitions. Second operand 4 states. [2019-11-26 02:57:53,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:53,169 INFO L93 Difference]: Finished difference Result 220 states and 325 transitions. [2019-11-26 02:57:53,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:53,170 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-11-26 02:57:53,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:53,171 INFO L225 Difference]: With dead ends: 220 [2019-11-26 02:57:53,171 INFO L226 Difference]: Without dead ends: 117 [2019-11-26 02:57:53,172 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:57:53,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2019-11-26 02:57:53,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2019-11-26 02:57:53,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2019-11-26 02:57:53,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 167 transitions. [2019-11-26 02:57:53,176 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 167 transitions. Word has length 53 [2019-11-26 02:57:53,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:53,176 INFO L462 AbstractCegarLoop]: Abstraction has 115 states and 167 transitions. [2019-11-26 02:57:53,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:53,177 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 167 transitions. [2019-11-26 02:57:53,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-26 02:57:53,177 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:53,178 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, 1, 1] [2019-11-26 02:57:53,178 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:53,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:53,178 INFO L82 PathProgramCache]: Analyzing trace with hash -1295111717, now seen corresponding path program 1 times [2019-11-26 02:57:53,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:53,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889255440] [2019-11-26 02:57:53,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:53,233 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:57:53,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889255440] [2019-11-26 02:57:53,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:53,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:57:53,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962881024] [2019-11-26 02:57:53,234 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:53,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:53,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:53,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:53,234 INFO L87 Difference]: Start difference. First operand 115 states and 167 transitions. Second operand 4 states. [2019-11-26 02:57:53,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:53,569 INFO L93 Difference]: Finished difference Result 252 states and 373 transitions. [2019-11-26 02:57:53,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:53,570 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-11-26 02:57:53,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:53,571 INFO L225 Difference]: With dead ends: 252 [2019-11-26 02:57:53,572 INFO L226 Difference]: Without dead ends: 149 [2019-11-26 02:57:53,572 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:57:53,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-26 02:57:53,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 135. [2019-11-26 02:57:53,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-26 02:57:53,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 201 transitions. [2019-11-26 02:57:53,580 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 201 transitions. Word has length 54 [2019-11-26 02:57:53,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:53,580 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 201 transitions. [2019-11-26 02:57:53,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:53,580 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 201 transitions. [2019-11-26 02:57:53,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-26 02:57:53,583 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:53,583 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, 1, 1] [2019-11-26 02:57:53,584 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:53,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:53,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1373254822, now seen corresponding path program 1 times [2019-11-26 02:57:53,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:53,584 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530586253] [2019-11-26 02:57:53,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:53,672 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:57:53,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530586253] [2019-11-26 02:57:53,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:53,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:57:53,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278806766] [2019-11-26 02:57:53,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:53,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:53,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:53,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:53,674 INFO L87 Difference]: Start difference. First operand 135 states and 201 transitions. Second operand 4 states. [2019-11-26 02:57:53,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:53,953 INFO L93 Difference]: Finished difference Result 272 states and 406 transitions. [2019-11-26 02:57:53,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:53,954 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-26 02:57:53,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:53,955 INFO L225 Difference]: With dead ends: 272 [2019-11-26 02:57:53,955 INFO L226 Difference]: Without dead ends: 149 [2019-11-26 02:57:53,956 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:57:53,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-11-26 02:57:53,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 135. [2019-11-26 02:57:53,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2019-11-26 02:57:53,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 200 transitions. [2019-11-26 02:57:53,961 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 200 transitions. Word has length 64 [2019-11-26 02:57:53,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:53,961 INFO L462 AbstractCegarLoop]: Abstraction has 135 states and 200 transitions. [2019-11-26 02:57:53,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:53,961 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 200 transitions. [2019-11-26 02:57:53,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-26 02:57:53,962 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:53,962 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, 1] [2019-11-26 02:57:53,962 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:53,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:53,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1091063250, now seen corresponding path program 1 times [2019-11-26 02:57:53,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:53,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240264555] [2019-11-26 02:57:53,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:54,050 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:57:54,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240264555] [2019-11-26 02:57:54,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:54,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:57:54,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977948447] [2019-11-26 02:57:54,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:57:54,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:54,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:57:54,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:57:54,052 INFO L87 Difference]: Start difference. First operand 135 states and 200 transitions. Second operand 5 states. [2019-11-26 02:57:54,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:54,470 INFO L93 Difference]: Finished difference Result 275 states and 411 transitions. [2019-11-26 02:57:54,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:57:54,472 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-11-26 02:57:54,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:54,473 INFO L225 Difference]: With dead ends: 275 [2019-11-26 02:57:54,473 INFO L226 Difference]: Without dead ends: 152 [2019-11-26 02:57:54,474 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:57:54,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-11-26 02:57:54,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2019-11-26 02:57:54,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:57:54,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 220 transitions. [2019-11-26 02:57:54,479 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 220 transitions. Word has length 65 [2019-11-26 02:57:54,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:54,480 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 220 transitions. [2019-11-26 02:57:54,480 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:57:54,480 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 220 transitions. [2019-11-26 02:57:54,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-26 02:57:54,481 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:54,481 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, 1, 1] [2019-11-26 02:57:54,481 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:54,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:54,481 INFO L82 PathProgramCache]: Analyzing trace with hash 47096135, now seen corresponding path program 1 times [2019-11-26 02:57:54,481 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:54,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624427540] [2019-11-26 02:57:54,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:54,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:54,530 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:57:54,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624427540] [2019-11-26 02:57:54,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:54,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:57:54,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346645885] [2019-11-26 02:57:54,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:54,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:54,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:54,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:54,532 INFO L87 Difference]: Start difference. First operand 151 states and 220 transitions. Second operand 4 states. [2019-11-26 02:57:54,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:54,865 INFO L93 Difference]: Finished difference Result 304 states and 443 transitions. [2019-11-26 02:57:54,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:54,866 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-26 02:57:54,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:54,867 INFO L225 Difference]: With dead ends: 304 [2019-11-26 02:57:54,867 INFO L226 Difference]: Without dead ends: 165 [2019-11-26 02:57:54,868 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:57:54,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-26 02:57:54,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 151. [2019-11-26 02:57:54,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:57:54,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 219 transitions. [2019-11-26 02:57:54,874 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 219 transitions. Word has length 66 [2019-11-26 02:57:54,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:54,874 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 219 transitions. [2019-11-26 02:57:54,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:54,874 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 219 transitions. [2019-11-26 02:57:54,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-26 02:57:54,875 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:54,875 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, 1, 1] [2019-11-26 02:57:54,875 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:54,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:54,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1043925002, now seen corresponding path program 1 times [2019-11-26 02:57:54,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:54,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335904715] [2019-11-26 02:57:54,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:54,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:54,922 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:57:54,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335904715] [2019-11-26 02:57:54,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:54,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:57:54,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804352232] [2019-11-26 02:57:54,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:54,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:54,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:54,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:54,925 INFO L87 Difference]: Start difference. First operand 151 states and 219 transitions. Second operand 4 states. [2019-11-26 02:57:55,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:55,296 INFO L93 Difference]: Finished difference Result 304 states and 441 transitions. [2019-11-26 02:57:55,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:55,297 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-26 02:57:55,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:55,298 INFO L225 Difference]: With dead ends: 304 [2019-11-26 02:57:55,298 INFO L226 Difference]: Without dead ends: 165 [2019-11-26 02:57:55,299 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:57:55,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-26 02:57:55,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 151. [2019-11-26 02:57:55,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:57:55,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 218 transitions. [2019-11-26 02:57:55,304 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 218 transitions. Word has length 66 [2019-11-26 02:57:55,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:55,305 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 218 transitions. [2019-11-26 02:57:55,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:55,305 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 218 transitions. [2019-11-26 02:57:55,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-26 02:57:55,306 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:55,306 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, 1, 1] [2019-11-26 02:57:55,306 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:55,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:55,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1046014816, now seen corresponding path program 1 times [2019-11-26 02:57:55,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:55,307 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821732033] [2019-11-26 02:57:55,307 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:55,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:55,352 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:57:55,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821732033] [2019-11-26 02:57:55,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:55,353 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:57:55,353 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192373355] [2019-11-26 02:57:55,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:55,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:55,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:55,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:55,354 INFO L87 Difference]: Start difference. First operand 151 states and 218 transitions. Second operand 4 states. [2019-11-26 02:57:55,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:55,652 INFO L93 Difference]: Finished difference Result 304 states and 439 transitions. [2019-11-26 02:57:55,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:55,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-26 02:57:55,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:55,655 INFO L225 Difference]: With dead ends: 304 [2019-11-26 02:57:55,655 INFO L226 Difference]: Without dead ends: 165 [2019-11-26 02:57:55,656 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:57:55,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-26 02:57:55,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 151. [2019-11-26 02:57:55,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:57:55,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 217 transitions. [2019-11-26 02:57:55,661 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 217 transitions. Word has length 66 [2019-11-26 02:57:55,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:55,662 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 217 transitions. [2019-11-26 02:57:55,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:55,662 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 217 transitions. [2019-11-26 02:57:55,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-26 02:57:55,662 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:55,663 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, 1, 1] [2019-11-26 02:57:55,663 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:55,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:55,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1821637, now seen corresponding path program 1 times [2019-11-26 02:57:55,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:55,663 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655655415] [2019-11-26 02:57:55,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:55,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:55,714 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:57:55,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655655415] [2019-11-26 02:57:55,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:55,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:57:55,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344671667] [2019-11-26 02:57:55,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:55,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:55,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:55,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:55,717 INFO L87 Difference]: Start difference. First operand 151 states and 217 transitions. Second operand 4 states. [2019-11-26 02:57:56,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:56,040 INFO L93 Difference]: Finished difference Result 304 states and 437 transitions. [2019-11-26 02:57:56,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:56,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-26 02:57:56,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:56,043 INFO L225 Difference]: With dead ends: 304 [2019-11-26 02:57:56,043 INFO L226 Difference]: Without dead ends: 165 [2019-11-26 02:57:56,043 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:57:56,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2019-11-26 02:57:56,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 151. [2019-11-26 02:57:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:57:56,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 216 transitions. [2019-11-26 02:57:56,051 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 216 transitions. Word has length 67 [2019-11-26 02:57:56,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:56,052 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 216 transitions. [2019-11-26 02:57:56,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:56,052 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 216 transitions. [2019-11-26 02:57:56,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-26 02:57:56,053 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:56,054 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, 1, 1] [2019-11-26 02:57:56,054 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:56,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:56,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1309652244, now seen corresponding path program 1 times [2019-11-26 02:57:56,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:56,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397687455] [2019-11-26 02:57:56,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:56,101 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:57:56,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397687455] [2019-11-26 02:57:56,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:56,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:57:56,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87590618] [2019-11-26 02:57:56,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:56,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:56,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:56,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:56,104 INFO L87 Difference]: Start difference. First operand 151 states and 216 transitions. Second operand 4 states. [2019-11-26 02:57:56,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:56,397 INFO L93 Difference]: Finished difference Result 302 states and 433 transitions. [2019-11-26 02:57:56,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:56,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-26 02:57:56,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:56,399 INFO L225 Difference]: With dead ends: 302 [2019-11-26 02:57:56,399 INFO L226 Difference]: Without dead ends: 163 [2019-11-26 02:57:56,400 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:57:56,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-26 02:57:56,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 151. [2019-11-26 02:57:56,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:57:56,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 215 transitions. [2019-11-26 02:57:56,408 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 215 transitions. Word has length 67 [2019-11-26 02:57:56,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:56,409 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 215 transitions. [2019-11-26 02:57:56,409 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:56,409 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 215 transitions. [2019-11-26 02:57:56,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-26 02:57:56,410 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:56,411 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, 1, 1] [2019-11-26 02:57:56,411 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:56,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:56,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1038633147, now seen corresponding path program 1 times [2019-11-26 02:57:56,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:56,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659042502] [2019-11-26 02:57:56,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:56,453 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:57:56,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659042502] [2019-11-26 02:57:56,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:56,454 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:57:56,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565723134] [2019-11-26 02:57:56,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:56,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:56,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:56,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:56,458 INFO L87 Difference]: Start difference. First operand 151 states and 215 transitions. Second operand 4 states. [2019-11-26 02:57:56,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:56,772 INFO L93 Difference]: Finished difference Result 302 states and 431 transitions. [2019-11-26 02:57:56,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:56,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-26 02:57:56,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:56,775 INFO L225 Difference]: With dead ends: 302 [2019-11-26 02:57:56,775 INFO L226 Difference]: Without dead ends: 163 [2019-11-26 02:57:56,775 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:57:56,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-26 02:57:56,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 151. [2019-11-26 02:57:56,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:57:56,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 214 transitions. [2019-11-26 02:57:56,781 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 214 transitions. Word has length 68 [2019-11-26 02:57:56,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:56,781 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 214 transitions. [2019-11-26 02:57:56,782 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:56,782 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 214 transitions. [2019-11-26 02:57:56,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-26 02:57:56,782 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:56,783 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, 1, 1] [2019-11-26 02:57:56,783 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:56,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:56,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1963197686, now seen corresponding path program 1 times [2019-11-26 02:57:56,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:56,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389764967] [2019-11-26 02:57:56,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:56,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:56,823 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:57:56,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389764967] [2019-11-26 02:57:56,823 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:57:56,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:57:56,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644365999] [2019-11-26 02:57:56,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:57:56,824 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:56,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:57:56,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:57:56,825 INFO L87 Difference]: Start difference. First operand 151 states and 214 transitions. Second operand 4 states. [2019-11-26 02:57:57,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:57,133 INFO L93 Difference]: Finished difference Result 294 states and 420 transitions. [2019-11-26 02:57:57,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:57:57,134 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-26 02:57:57,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:57,135 INFO L225 Difference]: With dead ends: 294 [2019-11-26 02:57:57,135 INFO L226 Difference]: Without dead ends: 155 [2019-11-26 02:57:57,136 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:57:57,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-11-26 02:57:57,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2019-11-26 02:57:57,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2019-11-26 02:57:57,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 213 transitions. [2019-11-26 02:57:57,142 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 213 transitions. Word has length 69 [2019-11-26 02:57:57,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:57,142 INFO L462 AbstractCegarLoop]: Abstraction has 151 states and 213 transitions. [2019-11-26 02:57:57,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:57:57,142 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 213 transitions. [2019-11-26 02:57:57,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-26 02:57:57,143 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:57,143 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, 1] [2019-11-26 02:57:57,144 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:57,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:57,144 INFO L82 PathProgramCache]: Analyzing trace with hash -729627723, now seen corresponding path program 1 times [2019-11-26 02:57:57,144 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:57,145 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39146315] [2019-11-26 02:57:57,145 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:57,230 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:57,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39146315] [2019-11-26 02:57:57,230 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737978596] [2019-11-26 02:57:57,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1f6c7238-d0cc-4eac-9c1c-3bb2e44d498a/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:57:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:57:57,392 INFO L255 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 02:57:57,405 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:57:57,430 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:57:57,431 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:57:57,447 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:57:57,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:57:57,519 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-26 02:57:57,520 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-26 02:57:57,521 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4, 4] total 6 [2019-11-26 02:57:57,521 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061762882] [2019-11-26 02:57:57,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:57:57,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:57:57,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:57:57,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:57:57,522 INFO L87 Difference]: Start difference. First operand 151 states and 213 transitions. Second operand 3 states. [2019-11-26 02:57:57,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:57:57,548 INFO L93 Difference]: Finished difference Result 288 states and 412 transitions. [2019-11-26 02:57:57,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:57:57,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-26 02:57:57,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:57:57,550 INFO L225 Difference]: With dead ends: 288 [2019-11-26 02:57:57,551 INFO L226 Difference]: Without dead ends: 286 [2019-11-26 02:57:57,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 139 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-26 02:57:57,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2019-11-26 02:57:57,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2019-11-26 02:57:57,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-11-26 02:57:57,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 408 transitions. [2019-11-26 02:57:57,568 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 408 transitions. Word has length 72 [2019-11-26 02:57:57,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:57:57,568 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 408 transitions. [2019-11-26 02:57:57,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:57:57,568 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 408 transitions. [2019-11-26 02:57:57,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-26 02:57:57,570 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:57:57,570 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, 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:57:57,775 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:57:57,775 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:57:57,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:57:57,776 INFO L82 PathProgramCache]: Analyzing trace with hash 138896190, now seen corresponding path program 1 times [2019-11-26 02:57:57,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:57:57,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817667346] [2019-11-26 02:57:57,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:57:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:57:58,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:57:58,139 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-11-26 02:57:58,140 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-26 02:57:58,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:57:58 BoogieIcfgContainer [2019-11-26 02:57:58,299 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:57:58,299 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:57:58,299 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:57:58,299 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:57:58,300 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:57:49" (3/4) ... [2019-11-26 02:57:58,308 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-26 02:57:58,308 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:57:58,310 INFO L168 Benchmark]: Toolchain (without parser) took 12201.33 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 282.1 MB). Free memory was 943.4 MB in the beginning and 1.2 GB in the end (delta: -236.7 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:57:58,312 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:57:58,313 INFO L168 Benchmark]: CACSL2BoogieTranslator took 816.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -186.3 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:57:58,314 INFO L168 Benchmark]: Boogie Procedure Inliner took 114.97 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:57:58,315 INFO L168 Benchmark]: Boogie Preprocessor took 128.09 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:57:58,315 INFO L168 Benchmark]: RCFGBuilder took 1936.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 956.0 MB in the end (delta: 163.0 MB). Peak memory consumption was 163.0 MB. Max. memory is 11.5 GB. [2019-11-26 02:57:58,316 INFO L168 Benchmark]: TraceAbstraction took 9191.38 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 123.7 MB). Free memory was 950.6 MB in the beginning and 1.2 GB in the end (delta: -229.5 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:57:58,316 INFO L168 Benchmark]: Witness Printer took 9.47 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:57:58,320 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 816.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -186.3 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 114.97 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 128.09 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 1936.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 956.0 MB in the end (delta: 163.0 MB). Peak memory consumption was 163.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 9191.38 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 123.7 MB). Free memory was 950.6 MB in the beginning and 1.2 GB in the end (delta: -229.5 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 9.47 ms. Allocated memory is still 1.3 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1702]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1121. Possible FailurePath: [L1042] static int init = 1; [L1043] static SSL_METHOD SSLv3_server_data ; [L1065] SSL *s ; [L1066] int tmp ; [L1070] s = malloc(sizeof(SSL)) [L1071] s->s3 = malloc(sizeof(struct ssl3_state_st)) [L1072] s->ctx = malloc(sizeof(SSL_CTX)) [L1073] s->session = malloc(sizeof(SSL_SESSION)) [L1074] s->state = 8464 [L1081] BUF_MEM *buf ; [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp ; [L1085] void (*cb)() ; [L1086] long num1 ; [L1087] int ret ; [L1088] int new_state ; [L1089] int state ; [L1090] int skip ; [L1091] int got_new_session ; [L1092] int tmp___1 = __VERIFIER_nondet_int() ; [L1093] int tmp___2 = __VERIFIER_nondet_int() ; [L1094] int tmp___3 = __VERIFIER_nondet_int() ; [L1095] int tmp___4 = __VERIFIER_nondet_int() ; [L1096] int tmp___5 = __VERIFIER_nondet_int() ; [L1097] int tmp___6 = __VERIFIER_nondet_int() ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 = __VERIFIER_nondet_int() ; [L1101] int tmp___10 = __VERIFIER_nondet_int() ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] tmp = __VERIFIER_nondet_int() [L1110] Time = tmp [L1111] cb = (void (*)())((void *)0) [L1112] ret = -1 [L1113] skip = 0 [L1114] got_new_session = 0 [L1115] EXPR s->info_callback [L1115] COND FALSE !((unsigned long )s->info_callback != (unsigned long )((void *)0)) [L1120] EXPR s->in_handshake [L1120] s->in_handshake += 1 [L1121] COND FALSE !(tmp___1 & 12288) [L1130] EXPR s->cert VAL [init=1, SSLv3_server_data={5:0}] [L1130] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1163] COND TRUE s->state == 8464 [L1323] s->shutdown = 0 [L1324] ret = __VERIFIER_nondet_int() [L1325] COND TRUE blastFlag == 0 [L1326] blastFlag = 1 VAL [init=1, SSLv3_server_data={5:0}] [L1330] COND FALSE !(ret <= 0) [L1335] got_new_session = 1 [L1336] s->state = 8496 [L1337] s->init_num = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={5:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1172] COND TRUE s->state == 8496 [L1341] ret = __VERIFIER_nondet_int() [L1342] COND TRUE blastFlag == 1 [L1343] blastFlag = 2 VAL [init=1, SSLv3_server_data={5:0}] [L1347] COND FALSE !(ret <= 0) [L1352] s->hit [L1352] COND TRUE s->hit [L1353] s->state = 8656 [L1357] s->init_num = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={5:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1229] COND TRUE s->state == 8656 [L1550] EXPR s->session [L1550] EXPR s->s3 [L1550] EXPR (s->s3)->tmp.new_cipher [L1550] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1551] COND FALSE !(! tmp___9) [L1557] ret = __VERIFIER_nondet_int() [L1558] COND TRUE blastFlag == 2 [L1559] blastFlag = 4 VAL [init=1, SSLv3_server_data={5:0}] [L1567] COND FALSE !(ret <= 0) [L1572] s->state = 8672 [L1573] s->init_num = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={5:0}] [L1661] EXPR s->s3 [L1661] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={5:0}] [L1661] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1690] skip = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1136] COND TRUE 1 [L1138] EXPR s->state [L1138] state = s->state [L1139] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1139] COND FALSE !(s->state == 12292) [L1142] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1142] COND FALSE !(s->state == 16384) [L1145] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1145] COND FALSE !(s->state == 8192) [L1148] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1148] COND FALSE !(s->state == 24576) [L1151] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1151] COND FALSE !(s->state == 8195) [L1154] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1154] COND FALSE !(s->state == 8480) [L1157] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1157] COND FALSE !(s->state == 8481) [L1160] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1160] COND FALSE !(s->state == 8482) [L1163] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1163] COND FALSE !(s->state == 8464) [L1166] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1166] COND FALSE !(s->state == 8465) [L1169] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1169] COND FALSE !(s->state == 8466) [L1172] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1172] COND FALSE !(s->state == 8496) [L1175] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1175] COND FALSE !(s->state == 8497) [L1178] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1178] COND FALSE !(s->state == 8512) [L1181] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1181] COND FALSE !(s->state == 8513) [L1184] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1184] COND FALSE !(s->state == 8528) [L1187] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1187] COND FALSE !(s->state == 8529) [L1190] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1190] COND FALSE !(s->state == 8544) [L1193] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1193] COND FALSE !(s->state == 8545) [L1196] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1196] COND FALSE !(s->state == 8560) [L1199] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1199] COND FALSE !(s->state == 8561) [L1202] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1202] COND FALSE !(s->state == 8448) [L1205] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1205] COND FALSE !(s->state == 8576) [L1208] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1208] COND FALSE !(s->state == 8577) [L1211] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1211] COND FALSE !(s->state == 8592) [L1214] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1214] COND FALSE !(s->state == 8593) [L1217] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1217] COND FALSE !(s->state == 8608) [L1220] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1220] COND FALSE !(s->state == 8609) [L1223] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1223] COND FALSE !(s->state == 8640) [L1226] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1226] COND FALSE !(s->state == 8641) [L1229] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1229] COND FALSE !(s->state == 8656) [L1232] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1232] COND FALSE !(s->state == 8657) [L1235] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1235] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND TRUE blastFlag == 4 VAL [init=1, SSLv3_server_data={5:0}] [L1702] __VERIFIER_error() VAL [init=1, SSLv3_server_data={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 108 locations, 1 error locations. Result: UNSAFE, OverallTime: 9.1s, OverallIterations: 21, TraceHistogramMax: 4, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2804 SDtfs, 562 SDslu, 4255 SDs, 0 SdLazy, 2485 SolverSat, 158 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 236 GetRequests, 168 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=284occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 211 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 1355 NumberOfCodeBlocks, 1355 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1294 ConstructedInterpolants, 0 QuantifiedInterpolants, 172202 SizeOfPredicates, 1 NumberOfNonLiveVariables, 423 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 22 InterpolantComputations, 20 PerfectInterpolantSequences, 301/373 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-6b5699a [2019-11-26 02:58:00,316 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:58:00,318 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:58:00,334 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:58:00,335 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:58:00,336 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:58:00,338 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:58:00,350 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:58:00,352 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:58:00,354 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:58:00,355 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:58:00,356 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:58:00,357 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:58:00,358 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:58:00,358 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:58:00,360 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:58:00,360 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:58:00,361 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:58:00,363 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:58:00,365 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:58:00,367 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:58:00,368 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:58:00,369 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:58:00,370 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:58:00,373 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:58:00,373 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:58:00,374 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:58:00,375 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:58:00,375 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:58:00,376 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:58:00,376 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:58:00,377 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:58:00,378 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:58:00,379 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:58:00,380 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:58:00,380 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:58:00,381 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:58:00,381 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:58:00,381 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:58:00,382 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:58:00,383 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:58:00,384 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1f6c7238-d0cc-4eac-9c1c-3bb2e44d498a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-11-26 02:58:00,398 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:58:00,398 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:58:00,399 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:58:00,399 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:58:00,400 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:58:00,400 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:58:00,400 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:58:00,400 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:58:00,401 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:58:00,401 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:58:00,402 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:58:00,402 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:58:00,402 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:58:00,402 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:58:00,403 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:58:00,403 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:58:00,403 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 02:58:00,403 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-26 02:58:00,404 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-26 02:58:00,404 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:58:00,404 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:58:00,404 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 02:58:00,405 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:58:00,405 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:58:00,405 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 02:58:00,405 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:58:00,406 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:58:00,406 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:58:00,406 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:58:00,406 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:58:00,407 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:58:00,407 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-11-26 02:58:00,407 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-26 02:58:00,407 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:58:00,408 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:58:00,408 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_1f6c7238-d0cc-4eac-9c1c-3bb2e44d498a/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 -> a85198d3f93b8c751f2c6e712deab62f97c1022f [2019-11-26 02:58:00,669 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:58:00,680 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:58:00,683 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:58:00,684 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:58:00,685 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:58:00,685 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1f6c7238-d0cc-4eac-9c1c-3bb2e44d498a/bin/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-11-26 02:58:00,736 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1f6c7238-d0cc-4eac-9c1c-3bb2e44d498a/bin/utaipan/data/6f00e3cda/1bf922591b654f8ab80d61b8b430e642/FLAG641367b5e [2019-11-26 02:58:01,221 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:58:01,222 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1f6c7238-d0cc-4eac-9c1c-3bb2e44d498a/sv-benchmarks/c/ssh/s3_srvr.blast.04.i.cil.c [2019-11-26 02:58:01,253 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1f6c7238-d0cc-4eac-9c1c-3bb2e44d498a/bin/utaipan/data/6f00e3cda/1bf922591b654f8ab80d61b8b430e642/FLAG641367b5e [2019-11-26 02:58:01,483 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1f6c7238-d0cc-4eac-9c1c-3bb2e44d498a/bin/utaipan/data/6f00e3cda/1bf922591b654f8ab80d61b8b430e642 [2019-11-26 02:58:01,485 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:58:01,486 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:58:01,487 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:58:01,488 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:58:01,491 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:58:01,491 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:58:01" (1/1) ... [2019-11-26 02:58:01,494 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2650757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:58:01, skipping insertion in model container [2019-11-26 02:58:01,494 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:58:01" (1/1) ... [2019-11-26 02:58:01,501 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:58:01,568 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:58:01,907 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:58:01,908 INFO L968 CHandler]: at location: C: (SSL_METHOD *)((void *)0) [1038] [2019-11-26 02:58:01,908 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-26 02:58:02,014 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:58:02,025 INFO L168 Benchmark]: Toolchain (without parser) took 537.31 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 950.9 MB in the beginning and 1.2 GB in the end (delta: -200.0 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2019-11-26 02:58:02,026 INFO L168 Benchmark]: CDTParser took 0.25 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:58:02,027 INFO L168 Benchmark]: CACSL2BoogieTranslator took 534.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 950.9 MB in the beginning and 1.2 GB in the end (delta: -200.0 MB). Peak memory consumption was 28.6 MB. Max. memory is 11.5 GB. [2019-11-26 02:58:02,030 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.25 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 534.97 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.1 MB). Free memory was 950.9 MB in the beginning and 1.2 GB in the end (delta: -200.0 MB). Peak memory consumption was 28.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...