./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_13.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_f0f724fc-e691-4e1a-82c8-e8e2eb171f3a/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_f0f724fc-e691-4e1a-82c8-e8e2eb171f3a/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_f0f724fc-e691-4e1a-82c8-e8e2eb171f3a/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_f0f724fc-e691-4e1a-82c8-e8e2eb171f3a/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_13.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_f0f724fc-e691-4e1a-82c8-e8e2eb171f3a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_f0f724fc-e691-4e1a-82c8-e8e2eb171f3a/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 a4ba7a359047c30b647e3fae146392c1b2eaa08f .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 16:39:12,067 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 16:39:12,068 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 16:39:12,076 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 16:39:12,076 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 16:39:12,077 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 16:39:12,078 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 16:39:12,079 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 16:39:12,080 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 16:39:12,081 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 16:39:12,081 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 16:39:12,082 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 16:39:12,082 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 16:39:12,083 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 16:39:12,083 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 16:39:12,084 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 16:39:12,085 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 16:39:12,085 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 16:39:12,087 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 16:39:12,088 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 16:39:12,089 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 16:39:12,090 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 16:39:12,091 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 16:39:12,091 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 16:39:12,093 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 16:39:12,093 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 16:39:12,093 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 16:39:12,094 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 16:39:12,094 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 16:39:12,094 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 16:39:12,095 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 16:39:12,095 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 16:39:12,095 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 16:39:12,096 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 16:39:12,096 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 16:39:12,097 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 16:39:12,097 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 16:39:12,097 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 16:39:12,097 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 16:39:12,098 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 16:39:12,098 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 16:39:12,099 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_f0f724fc-e691-4e1a-82c8-e8e2eb171f3a/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-12-07 16:39:12,108 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 16:39:12,108 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 16:39:12,109 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 16:39:12,109 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 16:39:12,109 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 16:39:12,109 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 16:39:12,109 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 16:39:12,109 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 16:39:12,109 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 16:39:12,110 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 16:39:12,110 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 16:39:12,110 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 16:39:12,110 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 16:39:12,110 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 16:39:12,110 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 16:39:12,110 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 16:39:12,111 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 16:39:12,111 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 16:39:12,111 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 16:39:12,111 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 16:39:12,111 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 16:39:12,111 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 16:39:12,111 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 16:39:12,111 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 16:39:12,111 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 16:39:12,112 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 16:39:12,112 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 16:39:12,112 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 16:39:12,112 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 16:39:12,112 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 16:39:12,112 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 16:39:12,112 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:39:12,112 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 16:39:12,113 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 16:39:12,113 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 16:39:12,113 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 16:39:12,113 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 16:39:12,113 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 16:39:12,113 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 16:39:12,113 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 16:39:12,113 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_f0f724fc-e691-4e1a-82c8-e8e2eb171f3a/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 -> a4ba7a359047c30b647e3fae146392c1b2eaa08f [2019-12-07 16:39:12,212 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 16:39:12,220 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 16:39:12,223 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 16:39:12,225 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 16:39:12,225 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 16:39:12,226 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_f0f724fc-e691-4e1a-82c8-e8e2eb171f3a/bin/utaipan/../../sv-benchmarks/c/ssh-simplified/s3_srvr_13.cil.c [2019-12-07 16:39:12,269 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f0f724fc-e691-4e1a-82c8-e8e2eb171f3a/bin/utaipan/data/e130320c9/3a9a6afe6d314b8593d08994c834449c/FLAGf8e1f1d24 [2019-12-07 16:39:12,693 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 16:39:12,694 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_f0f724fc-e691-4e1a-82c8-e8e2eb171f3a/sv-benchmarks/c/ssh-simplified/s3_srvr_13.cil.c [2019-12-07 16:39:12,701 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_f0f724fc-e691-4e1a-82c8-e8e2eb171f3a/bin/utaipan/data/e130320c9/3a9a6afe6d314b8593d08994c834449c/FLAGf8e1f1d24 [2019-12-07 16:39:12,710 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_f0f724fc-e691-4e1a-82c8-e8e2eb171f3a/bin/utaipan/data/e130320c9/3a9a6afe6d314b8593d08994c834449c [2019-12-07 16:39:12,712 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 16:39:12,713 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 16:39:12,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 16:39:12,713 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 16:39:12,716 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 16:39:12,716 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:39:12" (1/1) ... [2019-12-07 16:39:12,718 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17574348 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:39:12, skipping insertion in model container [2019-12-07 16:39:12,718 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 04:39:12" (1/1) ... [2019-12-07 16:39:12,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 16:39:12,750 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 16:39:12,927 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:39:12,930 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 16:39:12,969 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 16:39:12,978 INFO L208 MainTranslator]: Completed translation [2019-12-07 16:39:12,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:39:12 WrapperNode [2019-12-07 16:39:12,979 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 16:39:12,979 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 16:39:12,979 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 16:39:12,979 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 16:39:12,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:39:12" (1/1) ... [2019-12-07 16:39:12,991 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:39:12" (1/1) ... [2019-12-07 16:39:13,015 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 16:39:13,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 16:39:13,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 16:39:13,016 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 16:39:13,022 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:39:12" (1/1) ... [2019-12-07 16:39:13,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:39:12" (1/1) ... [2019-12-07 16:39:13,024 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:39:12" (1/1) ... [2019-12-07 16:39:13,024 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:39:12" (1/1) ... [2019-12-07 16:39:13,030 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:39:12" (1/1) ... [2019-12-07 16:39:13,036 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:39:12" (1/1) ... [2019-12-07 16:39:13,038 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:39:12" (1/1) ... [2019-12-07 16:39:13,041 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 16:39:13,041 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 16:39:13,041 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 16:39:13,041 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 16:39:13,042 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:39:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f0f724fc-e691-4e1a-82c8-e8e2eb171f3a/bin/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 16:39:13,081 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 16:39:13,081 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 16:39:13,162 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-12-07 16:39:13,480 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-12-07 16:39:13,480 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-12-07 16:39:13,664 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 16:39:13,664 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-12-07 16:39:13,665 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:39:13 BoogieIcfgContainer [2019-12-07 16:39:13,665 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 16:39:13,666 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 16:39:13,666 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 16:39:13,668 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 16:39:13,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 04:39:12" (1/3) ... [2019-12-07 16:39:13,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f1e5374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:39:13, skipping insertion in model container [2019-12-07 16:39:13,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 04:39:12" (2/3) ... [2019-12-07 16:39:13,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f1e5374 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 04:39:13, skipping insertion in model container [2019-12-07 16:39:13,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:39:13" (3/3) ... [2019-12-07 16:39:13,670 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_13.cil.c [2019-12-07 16:39:13,677 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 16:39:13,682 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-12-07 16:39:13,690 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-12-07 16:39:13,706 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 16:39:13,706 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 16:39:13,706 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 16:39:13,707 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 16:39:13,707 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 16:39:13,707 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 16:39:13,707 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 16:39:13,707 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 16:39:13,719 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states. [2019-12-07 16:39:13,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-07 16:39:13,723 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:39:13,724 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:39:13,724 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:39:13,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:39:13,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1750142300, now seen corresponding path program 1 times [2019-12-07 16:39:13,734 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:39:13,734 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084514577] [2019-12-07 16:39:13,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:39:13,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:39:13,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:39:13,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084514577] [2019-12-07 16:39:13,850 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:39:13,850 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 16:39:13,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452398555] [2019-12-07 16:39:13,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:39:13,854 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:39:13,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:39:13,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:39:13,864 INFO L87 Difference]: Start difference. First operand 114 states. Second operand 3 states. [2019-12-07 16:39:14,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:39:14,021 INFO L93 Difference]: Finished difference Result 250 states and 435 transitions. [2019-12-07 16:39:14,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:39:14,022 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-12-07 16:39:14,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:39:14,034 INFO L225 Difference]: With dead ends: 250 [2019-12-07 16:39:14,035 INFO L226 Difference]: Without dead ends: 132 [2019-12-07 16:39:14,038 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:39:14,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-12-07 16:39:14,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2019-12-07 16:39:14,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-12-07 16:39:14,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 193 transitions. [2019-12-07 16:39:14,073 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 193 transitions. Word has length 19 [2019-12-07 16:39:14,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:39:14,073 INFO L462 AbstractCegarLoop]: Abstraction has 130 states and 193 transitions. [2019-12-07 16:39:14,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:39:14,073 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 193 transitions. [2019-12-07 16:39:14,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 16:39:14,074 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:39:14,074 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] [2019-12-07 16:39:14,074 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:39:14,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:39:14,074 INFO L82 PathProgramCache]: Analyzing trace with hash -11900598, now seen corresponding path program 1 times [2019-12-07 16:39:14,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:39:14,075 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537538377] [2019-12-07 16:39:14,075 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:39:14,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:39:14,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:39:14,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537538377] [2019-12-07 16:39:14,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:39:14,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:39:14,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330155737] [2019-12-07 16:39:14,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:39:14,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:39:14,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:39:14,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:39:14,131 INFO L87 Difference]: Start difference. First operand 130 states and 193 transitions. Second operand 4 states. [2019-12-07 16:39:14,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:39:14,235 INFO L93 Difference]: Finished difference Result 271 states and 401 transitions. [2019-12-07 16:39:14,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:39:14,235 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-12-07 16:39:14,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:39:14,237 INFO L225 Difference]: With dead ends: 271 [2019-12-07 16:39:14,237 INFO L226 Difference]: Without dead ends: 143 [2019-12-07 16:39:14,238 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-12-07 16:39:14,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2019-12-07 16:39:14,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 136. [2019-12-07 16:39:14,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-12-07 16:39:14,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 201 transitions. [2019-12-07 16:39:14,247 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 201 transitions. Word has length 24 [2019-12-07 16:39:14,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:39:14,247 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 201 transitions. [2019-12-07 16:39:14,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:39:14,247 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 201 transitions. [2019-12-07 16:39:14,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-07 16:39:14,248 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:39:14,248 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] [2019-12-07 16:39:14,248 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:39:14,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:39:14,249 INFO L82 PathProgramCache]: Analyzing trace with hash 234265027, now seen corresponding path program 1 times [2019-12-07 16:39:14,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:39:14,249 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782672158] [2019-12-07 16:39:14,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:39:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:39:14,286 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:39:14,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782672158] [2019-12-07 16:39:14,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:39:14,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:39:14,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181042313] [2019-12-07 16:39:14,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:39:14,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:39:14,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:39:14,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:39:14,288 INFO L87 Difference]: Start difference. First operand 136 states and 201 transitions. Second operand 3 states. [2019-12-07 16:39:14,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:39:14,412 INFO L93 Difference]: Finished difference Result 324 states and 494 transitions. [2019-12-07 16:39:14,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:39:14,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-12-07 16:39:14,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:39:14,414 INFO L225 Difference]: With dead ends: 324 [2019-12-07 16:39:14,414 INFO L226 Difference]: Without dead ends: 178 [2019-12-07 16:39:14,415 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:39:14,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-12-07 16:39:14,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 175. [2019-12-07 16:39:14,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2019-12-07 16:39:14,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 254 transitions. [2019-12-07 16:39:14,424 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 254 transitions. Word has length 34 [2019-12-07 16:39:14,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:39:14,425 INFO L462 AbstractCegarLoop]: Abstraction has 175 states and 254 transitions. [2019-12-07 16:39:14,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:39:14,425 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 254 transitions. [2019-12-07 16:39:14,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-07 16:39:14,426 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:39:14,426 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:39:14,427 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:39:14,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:39:14,427 INFO L82 PathProgramCache]: Analyzing trace with hash -509312477, now seen corresponding path program 1 times [2019-12-07 16:39:14,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:39:14,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831588138] [2019-12-07 16:39:14,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:39:14,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:39:14,465 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:39:14,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831588138] [2019-12-07 16:39:14,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1756808339] [2019-12-07 16:39:14,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f0f724fc-e691-4e1a-82c8-e8e2eb171f3a/bin/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:39:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:39:14,521 INFO L264 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 16:39:14,526 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:39:14,540 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:39:14,540 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:39:14,557 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:39:14,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1906536689] [2019-12-07 16:39:14,586 INFO L159 IcfgInterpreter]: Started Sifa with 31 locations of interest [2019-12-07 16:39:14,587 INFO L166 IcfgInterpreter]: Building call graph [2019-12-07 16:39:14,592 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-12-07 16:39:14,596 INFO L176 IcfgInterpreter]: Starting interpretation [2019-12-07 16:39:14,597 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-12-07 16:39:15,456 INFO L180 IcfgInterpreter]: Interpretation finished [2019-12-07 16:39:15,988 WARN L192 SmtUtils]: Spent 505.00 ms on a formula simplification. DAG size of input: 185 DAG size of output: 168 [2019-12-07 16:39:16,351 WARN L192 SmtUtils]: Spent 334.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 143 [2019-12-07 16:39:16,729 WARN L192 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 147 [2019-12-07 16:39:17,152 WARN L192 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 149 [2019-12-07 16:39:17,724 WARN L192 SmtUtils]: Spent 480.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 150 [2019-12-07 16:39:18,295 WARN L192 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 153 [2019-12-07 16:39:18,669 WARN L192 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 146 [2019-12-07 16:39:19,075 WARN L192 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 149 [2019-12-07 16:39:19,463 WARN L192 SmtUtils]: Spent 349.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 146 [2019-12-07 16:39:19,875 WARN L192 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 152 [2019-12-07 16:39:20,333 WARN L192 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 150 [2019-12-07 16:39:20,786 WARN L192 SmtUtils]: Spent 387.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 154 [2019-12-07 16:39:21,237 WARN L192 SmtUtils]: Spent 395.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 156 [2019-12-07 16:39:21,831 WARN L192 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 151 [2019-12-07 16:39:22,269 WARN L192 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 154 [2019-12-07 16:39:22,711 WARN L192 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 157 [2019-12-07 16:39:23,160 WARN L192 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 147 [2019-12-07 16:39:23,589 WARN L192 SmtUtils]: Spent 376.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 151 [2019-12-07 16:39:24,222 WARN L192 SmtUtils]: Spent 544.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 152 [2019-12-07 16:39:24,819 WARN L192 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 153 [2019-12-07 16:39:25,305 WARN L192 SmtUtils]: Spent 394.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 151 [2019-12-07 16:39:25,818 WARN L192 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 171 DAG size of output: 154 [2019-12-07 16:39:26,377 WARN L192 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 174 DAG size of output: 157 [2019-12-07 16:39:26,985 WARN L192 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 163 [2019-12-07 16:39:26,987 INFO L343 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-12-07 16:39:26,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-12-07 16:39:26,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2019-12-07 16:39:26,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726569383] [2019-12-07 16:39:26,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:39:26,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:39:26,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:39:26,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=665, Unknown=0, NotChecked=0, Total=870 [2019-12-07 16:39:26,989 INFO L87 Difference]: Start difference. First operand 175 states and 254 transitions. Second operand 6 states. [2019-12-07 16:39:27,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:39:27,134 INFO L93 Difference]: Finished difference Result 395 states and 567 transitions. [2019-12-07 16:39:27,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 16:39:27,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-07 16:39:27,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:39:27,136 INFO L225 Difference]: With dead ends: 395 [2019-12-07 16:39:27,136 INFO L226 Difference]: Without dead ends: 222 [2019-12-07 16:39:27,137 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 92 SyntacticMatches, 9 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=211, Invalid=719, Unknown=0, NotChecked=0, Total=930 [2019-12-07 16:39:27,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-12-07 16:39:27,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 198. [2019-12-07 16:39:27,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-12-07 16:39:27,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 283 transitions. [2019-12-07 16:39:27,149 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 283 transitions. Word has length 42 [2019-12-07 16:39:27,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:39:27,149 INFO L462 AbstractCegarLoop]: Abstraction has 198 states and 283 transitions. [2019-12-07 16:39:27,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:39:27,149 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 283 transitions. [2019-12-07 16:39:27,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-07 16:39:27,152 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:39:27,152 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2019-12-07 16:39:27,352 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:39:27,353 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:39:27,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:39:27,353 INFO L82 PathProgramCache]: Analyzing trace with hash -267028804, now seen corresponding path program 2 times [2019-12-07 16:39:27,353 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:39:27,354 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173728117] [2019-12-07 16:39:27,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:39:27,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:39:27,418 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 16:39:27,418 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173728117] [2019-12-07 16:39:27,418 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:39:27,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:39:27,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564464384] [2019-12-07 16:39:27,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:39:27,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:39:27,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:39:27,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:39:27,419 INFO L87 Difference]: Start difference. First operand 198 states and 283 transitions. Second operand 4 states. [2019-12-07 16:39:27,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:39:27,514 INFO L93 Difference]: Finished difference Result 452 states and 645 transitions. [2019-12-07 16:39:27,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:39:27,514 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-12-07 16:39:27,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:39:27,516 INFO L225 Difference]: With dead ends: 452 [2019-12-07 16:39:27,516 INFO L226 Difference]: Without dead ends: 256 [2019-12-07 16:39:27,516 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:39:27,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2019-12-07 16:39:27,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 184. [2019-12-07 16:39:27,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-12-07 16:39:27,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 267 transitions. [2019-12-07 16:39:27,524 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 267 transitions. Word has length 60 [2019-12-07 16:39:27,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:39:27,525 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 267 transitions. [2019-12-07 16:39:27,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:39:27,525 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 267 transitions. [2019-12-07 16:39:27,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 16:39:27,527 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:39:27,527 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-12-07 16:39:27,527 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:39:27,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:39:27,528 INFO L82 PathProgramCache]: Analyzing trace with hash 364723740, now seen corresponding path program 1 times [2019-12-07 16:39:27,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:39:27,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406761489] [2019-12-07 16:39:27,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:39:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:39:27,562 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-12-07 16:39:27,562 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406761489] [2019-12-07 16:39:27,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:39:27,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 16:39:27,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114336270] [2019-12-07 16:39:27,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 16:39:27,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:39:27,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 16:39:27,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 16:39:27,563 INFO L87 Difference]: Start difference. First operand 184 states and 267 transitions. Second operand 4 states. [2019-12-07 16:39:27,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:39:27,657 INFO L93 Difference]: Finished difference Result 396 states and 570 transitions. [2019-12-07 16:39:27,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:39:27,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 61 [2019-12-07 16:39:27,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:39:27,659 INFO L225 Difference]: With dead ends: 396 [2019-12-07 16:39:27,660 INFO L226 Difference]: Without dead ends: 214 [2019-12-07 16:39:27,660 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 16:39:27,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2019-12-07 16:39:27,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 182. [2019-12-07 16:39:27,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-12-07 16:39:27,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 265 transitions. [2019-12-07 16:39:27,667 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 265 transitions. Word has length 61 [2019-12-07 16:39:27,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:39:27,667 INFO L462 AbstractCegarLoop]: Abstraction has 182 states and 265 transitions. [2019-12-07 16:39:27,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 16:39:27,667 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 265 transitions. [2019-12-07 16:39:27,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-07 16:39:27,668 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:39:27,668 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] [2019-12-07 16:39:27,668 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:39:27,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:39:27,669 INFO L82 PathProgramCache]: Analyzing trace with hash 458085691, now seen corresponding path program 1 times [2019-12-07 16:39:27,669 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:39:27,669 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822151881] [2019-12-07 16:39:27,669 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:39:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:39:27,707 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 16:39:27,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822151881] [2019-12-07 16:39:27,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718346862] [2019-12-07 16:39:27,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_f0f724fc-e691-4e1a-82c8-e8e2eb171f3a/bin/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:39:27,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:39:27,747 INFO L264 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 16:39:27,750 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 16:39:27,772 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 16:39:27,772 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 16:39:27,790 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-12-07 16:39:27,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-12-07 16:39:27,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [4] total 9 [2019-12-07 16:39:27,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438175472] [2019-12-07 16:39:27,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 16:39:27,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:39:27,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 16:39:27,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:39:27,791 INFO L87 Difference]: Start difference. First operand 182 states and 265 transitions. Second operand 6 states. [2019-12-07 16:39:28,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:39:28,011 INFO L93 Difference]: Finished difference Result 464 states and 708 transitions. [2019-12-07 16:39:28,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 16:39:28,011 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-07 16:39:28,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:39:28,013 INFO L225 Difference]: With dead ends: 464 [2019-12-07 16:39:28,013 INFO L226 Difference]: Without dead ends: 284 [2019-12-07 16:39:28,014 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-07 16:39:28,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2019-12-07 16:39:28,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 254. [2019-12-07 16:39:28,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2019-12-07 16:39:28,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 351 transitions. [2019-12-07 16:39:28,020 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 351 transitions. Word has length 61 [2019-12-07 16:39:28,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:39:28,020 INFO L462 AbstractCegarLoop]: Abstraction has 254 states and 351 transitions. [2019-12-07 16:39:28,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 16:39:28,020 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 351 transitions. [2019-12-07 16:39:28,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-07 16:39:28,021 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:39:28,021 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-12-07 16:39:28,222 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-12-07 16:39:28,222 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:39:28,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:39:28,222 INFO L82 PathProgramCache]: Analyzing trace with hash 88370196, now seen corresponding path program 1 times [2019-12-07 16:39:28,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:39:28,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867350132] [2019-12-07 16:39:28,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:39:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:39:28,242 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-07 16:39:28,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867350132] [2019-12-07 16:39:28,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:39:28,243 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:39:28,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54018856] [2019-12-07 16:39:28,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:39:28,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:39:28,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:39:28,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:39:28,244 INFO L87 Difference]: Start difference. First operand 254 states and 351 transitions. Second operand 3 states. [2019-12-07 16:39:28,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:39:28,258 INFO L93 Difference]: Finished difference Result 516 states and 714 transitions. [2019-12-07 16:39:28,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:39:28,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-07 16:39:28,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:39:28,260 INFO L225 Difference]: With dead ends: 516 [2019-12-07 16:39:28,260 INFO L226 Difference]: Without dead ends: 264 [2019-12-07 16:39:28,261 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:39:28,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2019-12-07 16:39:28,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 262. [2019-12-07 16:39:28,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 262 states. [2019-12-07 16:39:28,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 262 states to 262 states and 361 transitions. [2019-12-07 16:39:28,266 INFO L78 Accepts]: Start accepts. Automaton has 262 states and 361 transitions. Word has length 63 [2019-12-07 16:39:28,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:39:28,267 INFO L462 AbstractCegarLoop]: Abstraction has 262 states and 361 transitions. [2019-12-07 16:39:28,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:39:28,267 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 361 transitions. [2019-12-07 16:39:28,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-07 16:39:28,267 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:39:28,268 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2019-12-07 16:39:28,268 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:39:28,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:39:28,268 INFO L82 PathProgramCache]: Analyzing trace with hash 903544969, now seen corresponding path program 1 times [2019-12-07 16:39:28,268 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:39:28,268 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621930217] [2019-12-07 16:39:28,268 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:39:28,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:39:28,288 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-12-07 16:39:28,289 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621930217] [2019-12-07 16:39:28,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:39:28,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:39:28,289 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086759676] [2019-12-07 16:39:28,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:39:28,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:39:28,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:39:28,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:39:28,290 INFO L87 Difference]: Start difference. First operand 262 states and 361 transitions. Second operand 3 states. [2019-12-07 16:39:28,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:39:28,406 INFO L93 Difference]: Finished difference Result 580 states and 823 transitions. [2019-12-07 16:39:28,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:39:28,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-07 16:39:28,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:39:28,408 INFO L225 Difference]: With dead ends: 580 [2019-12-07 16:39:28,408 INFO L226 Difference]: Without dead ends: 308 [2019-12-07 16:39:28,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:39:28,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-12-07 16:39:28,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 291. [2019-12-07 16:39:28,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2019-12-07 16:39:28,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 408 transitions. [2019-12-07 16:39:28,414 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 408 transitions. Word has length 64 [2019-12-07 16:39:28,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:39:28,414 INFO L462 AbstractCegarLoop]: Abstraction has 291 states and 408 transitions. [2019-12-07 16:39:28,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:39:28,415 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 408 transitions. [2019-12-07 16:39:28,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-07 16:39:28,415 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:39:28,415 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:39:28,416 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:39:28,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:39:28,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1071934495, now seen corresponding path program 1 times [2019-12-07 16:39:28,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:39:28,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109265342] [2019-12-07 16:39:28,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:39:28,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 16:39:28,433 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-12-07 16:39:28,434 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109265342] [2019-12-07 16:39:28,434 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 16:39:28,434 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 16:39:28,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623211119] [2019-12-07 16:39:28,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 16:39:28,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 16:39:28,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 16:39:28,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:39:28,435 INFO L87 Difference]: Start difference. First operand 291 states and 408 transitions. Second operand 3 states. [2019-12-07 16:39:28,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 16:39:28,507 INFO L93 Difference]: Finished difference Result 603 states and 849 transitions. [2019-12-07 16:39:28,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 16:39:28,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-12-07 16:39:28,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 16:39:28,509 INFO L225 Difference]: With dead ends: 603 [2019-12-07 16:39:28,509 INFO L226 Difference]: Without dead ends: 314 [2019-12-07 16:39:28,509 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 16:39:28,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-12-07 16:39:28,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2019-12-07 16:39:28,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-12-07 16:39:28,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 432 transitions. [2019-12-07 16:39:28,515 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 432 transitions. Word has length 71 [2019-12-07 16:39:28,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 16:39:28,516 INFO L462 AbstractCegarLoop]: Abstraction has 312 states and 432 transitions. [2019-12-07 16:39:28,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 16:39:28,516 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 432 transitions. [2019-12-07 16:39:28,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-12-07 16:39:28,516 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 16:39:28,516 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 16:39:28,517 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 16:39:28,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 16:39:28,517 INFO L82 PathProgramCache]: Analyzing trace with hash 222171739, now seen corresponding path program 1 times [2019-12-07 16:39:28,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 16:39:28,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955287731] [2019-12-07 16:39:28,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 16:39:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:39:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 16:39:28,586 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 16:39:28,586 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 16:39:28,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 04:39:28 BoogieIcfgContainer [2019-12-07 16:39:28,626 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 16:39:28,627 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 16:39:28,627 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 16:39:28,627 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 16:39:28,627 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 04:39:13" (3/4) ... [2019-12-07 16:39:28,629 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-12-07 16:39:28,691 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_f0f724fc-e691-4e1a-82c8-e8e2eb171f3a/bin/utaipan/witness.graphml [2019-12-07 16:39:28,691 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 16:39:28,692 INFO L168 Benchmark]: Toolchain (without parser) took 15979.69 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 390.6 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -175.2 MB). Peak memory consumption was 215.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:39:28,692 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:39:28,693 INFO L168 Benchmark]: CACSL2BoogieTranslator took 265.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.8 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -134.8 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. [2019-12-07 16:39:28,693 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.23 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 16:39:28,693 INFO L168 Benchmark]: Boogie Preprocessor took 25.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:39:28,693 INFO L168 Benchmark]: RCFGBuilder took 624.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 981.3 MB in the end (delta: 94.4 MB). Peak memory consumption was 94.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:39:28,694 INFO L168 Benchmark]: TraceAbstraction took 14960.49 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 298.8 MB). Free memory was 981.3 MB in the beginning and 1.1 GB in the end (delta: -154.4 MB). Peak memory consumption was 144.4 MB. Max. memory is 11.5 GB. [2019-12-07 16:39:28,694 INFO L168 Benchmark]: Witness Printer took 64.73 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2019-12-07 16:39:28,695 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 961.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 265.49 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 91.8 MB). Free memory was 946.2 MB in the beginning and 1.1 GB in the end (delta: -134.8 MB). Peak memory consumption was 23.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.23 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 25.48 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 624.21 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 981.3 MB in the end (delta: 94.4 MB). Peak memory consumption was 94.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14960.49 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 298.8 MB). Free memory was 981.3 MB in the beginning and 1.1 GB in the end (delta: -154.4 MB). Peak memory consumption was 144.4 MB. Max. memory is 11.5 GB. * Witness Printer took 64.73 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 642]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L647] int s ; [L648] int tmp ; [L652] s = 8464 [L11] int s__info_callback = __VERIFIER_nondet_int() ; [L12] int s__in_handshake = __VERIFIER_nondet_int() ; [L13] int s__state ; [L14] int s__new_session ; [L15] int s__server ; [L16] int s__version = __VERIFIER_nondet_int() ; [L17] int s__type ; [L18] int s__init_num ; [L19] int s__hit = __VERIFIER_nondet_int() ; [L20] int s__rwstate ; [L21] int s__init_buf___0 = 1; [L22] int s__debug = __VERIFIER_nondet_int() ; [L23] int s__shutdown ; [L24] int s__cert = __VERIFIER_nondet_int() ; [L25] int s__options = __VERIFIER_nondet_int() ; [L26] int s__verify_mode = __VERIFIER_nondet_int() ; [L27] int s__session__peer = __VERIFIER_nondet_int() ; [L28] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L29] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L30] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L33] int s__s3__tmp__cert_request ; [L34] int s__s3__tmp__reuse_message ; [L35] int s__s3__tmp__use_rsa_tmp ; [L36] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L37] int s__s3__tmp__new_cipher__algorithms ; [L38] int s__s3__tmp__next_state___0 ; [L39] int s__s3__tmp__new_cipher__algo_strength ; [L40] int s__session__cipher ; [L41] int buf ; [L42] unsigned long l ; [L43] unsigned long Time ; [L44] unsigned long tmp ; [L45] int cb ; [L46] long num1 = __VERIFIER_nondet_long() ; [L47] int ret ; [L48] int new_state ; [L49] int state ; [L50] int skip ; [L51] int got_new_session ; [L52] int tmp___1 = __VERIFIER_nondet_int() ; [L53] int tmp___2 = __VERIFIER_nondet_int() ; [L54] int tmp___3 = __VERIFIER_nondet_int() ; [L55] int tmp___4 = __VERIFIER_nondet_int() ; [L56] int tmp___5 = __VERIFIER_nondet_int() ; [L57] int tmp___6 = __VERIFIER_nondet_int() ; [L58] int tmp___7 = __VERIFIER_nondet_int() ; [L59] long tmp___8 = __VERIFIER_nondet_long() ; [L60] int tmp___9 = __VERIFIER_nondet_int() ; [L61] int tmp___10 = __VERIFIER_nondet_int() ; [L62] int blastFlag ; [L63] int __cil_tmp55 ; [L64] unsigned long __cil_tmp56 ; [L65] unsigned long __cil_tmp57 ; [L66] unsigned long __cil_tmp58 ; [L67] unsigned long __cil_tmp59 ; [L68] int __cil_tmp60 ; [L69] unsigned long __cil_tmp61 ; [L72] s__state = initial_state [L73] blastFlag = 0 [L74] tmp = __VERIFIER_nondet_int() [L75] Time = tmp [L76] cb = 0 [L77] ret = -1 [L78] skip = 0 [L79] got_new_session = 0 [L80] COND TRUE s__info_callback != 0 [L81] cb = s__info_callback [L87] s__in_handshake ++ [L88] COND FALSE !(tmp___1 + 12288) [L93] COND FALSE !(s__cert == 0) [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND TRUE s__state == 8464 [L270] s__shutdown = 0 [L271] ret = __VERIFIER_nondet_int() [L272] COND TRUE blastFlag == 0 [L273] blastFlag = 1 [L275] COND FALSE !(ret <= 0) [L278] got_new_session = 1 [L279] s__state = 8496 [L280] s__init_num = 0 [L599] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L600] COND FALSE !(! s__s3__tmp__reuse_message) [L631] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND FALSE !(s__state == 8464) [L127] COND FALSE !(s__state == 8465) [L130] COND FALSE !(s__state == 8466) [L133] COND TRUE s__state == 8496 [L284] ret = __VERIFIER_nondet_int() [L285] COND TRUE blastFlag == 1 [L286] blastFlag = 2 [L288] COND FALSE !(ret <= 0) [L291] COND FALSE !(\read(s__hit)) [L294] s__state = 8512 [L296] s__init_num = 0 [L599] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L600] COND FALSE !(! s__s3__tmp__reuse_message) [L631] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND FALSE !(s__state == 8464) [L127] COND FALSE !(s__state == 8465) [L130] COND FALSE !(s__state == 8466) [L133] COND FALSE !(s__state == 8496) [L136] COND FALSE !(s__state == 8497) [L139] COND TRUE s__state == 8512 [L301] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L302] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L303] COND TRUE __cil_tmp56 + 256UL [L304] skip = 1 [L315] s__state = 8528 [L316] s__init_num = 0 [L599] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L600] COND FALSE !(! s__s3__tmp__reuse_message) [L631] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND FALSE !(s__state == 8464) [L127] COND FALSE !(s__state == 8465) [L130] COND FALSE !(s__state == 8466) [L133] COND FALSE !(s__state == 8496) [L136] COND FALSE !(s__state == 8497) [L139] COND FALSE !(s__state == 8512) [L142] COND FALSE !(s__state == 8513) [L145] COND TRUE s__state == 8528 [L320] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L321] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L323] __cil_tmp57 = (unsigned long )s__options [L324] COND TRUE __cil_tmp57 + 2097152UL [L325] s__s3__tmp__use_rsa_tmp = 1 [L330] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L357] ret = __VERIFIER_nondet_int() [L358] COND FALSE !(blastFlag == 6) [L361] COND FALSE !(ret <= 0) [L378] s__state = 8544 [L379] s__init_num = 0 [L599] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L600] COND TRUE ! s__s3__tmp__reuse_message [L601] COND TRUE ! skip [L602] COND TRUE state == 8528 [L603] COND TRUE s__state == 8544 [L604] COND TRUE tmp___7 != 1024 [L605] COND TRUE tmp___7 != 512 [L606] COND TRUE __cil_tmp58 != 4294967294 [L607] COND TRUE l != 4294967266 [L642] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 114 locations, 1 error locations. Result: UNSAFE, OverallTime: 14.8s, OverallIterations: 11, TraceHistogramMax: 4, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1513 SDtfs, 855 SDslu, 1655 SDs, 0 SdLazy, 1500 SolverSat, 278 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 285 GetRequests, 225 SyntacticMatches, 10 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 11.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=312occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 191 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 690 NumberOfCodeBlocks, 690 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 691 ConstructedInterpolants, 0 QuantifiedInterpolants, 72981 SizeOfPredicates, 5 NumberOfNonLiveVariables, 335 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 312/354 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 proved your program to be incorrect! Received shutdown request...