./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_9165fa7b-1972-45a4-92bc-dcf663867b5f/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9165fa7b-1972-45a4-92bc-dcf663867b5f/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9165fa7b-1972-45a4-92bc-dcf663867b5f/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9165fa7b-1972-45a4-92bc-dcf663867b5f/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9165fa7b-1972-45a4-92bc-dcf663867b5f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9165fa7b-1972-45a4-92bc-dcf663867b5f/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 9eb992f5fc2d1a4c635ca3f801d15ea699dd32d7 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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_9165fa7b-1972-45a4-92bc-dcf663867b5f/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_9165fa7b-1972-45a4-92bc-dcf663867b5f/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_9165fa7b-1972-45a4-92bc-dcf663867b5f/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_9165fa7b-1972-45a4-92bc-dcf663867b5f/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_9165fa7b-1972-45a4-92bc-dcf663867b5f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_9165fa7b-1972-45a4-92bc-dcf663867b5f/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 9eb992f5fc2d1a4c635ca3f801d15ea699dd32d7 .................................................................................................................................................................. 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:40:17,457 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:40:17,459 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:40:17,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:40:17,470 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:40:17,471 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:40:17,472 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:40:17,474 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:40:17,476 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:40:17,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:40:17,478 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:40:17,479 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:40:17,479 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:40:17,480 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:40:17,481 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:40:17,482 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:40:17,483 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:40:17,484 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:40:17,485 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:40:17,487 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:40:17,489 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:40:17,490 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:40:17,491 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:40:17,492 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:40:17,500 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:40:17,500 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:40:17,501 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:40:17,502 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:40:17,502 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:40:17,503 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:40:17,503 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:40:17,504 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:40:17,505 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:40:17,505 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:40:17,506 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:40:17,507 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:40:17,507 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:40:17,507 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:40:17,508 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:40:17,508 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:40:17,509 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:40:17,510 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9165fa7b-1972-45a4-92bc-dcf663867b5f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:40:17,535 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:40:17,535 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:40:17,536 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:40:17,536 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:40:17,536 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:40:17,537 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:40:17,537 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:40:17,537 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:40:17,537 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:40:17,537 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:40:17,538 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:40:17,538 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:40:17,539 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:40:17,539 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:40:17,539 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:40:17,540 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:40:17,540 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:40:17,540 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:40:17,540 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:40:17,540 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:40:17,541 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:40:17,541 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:40:17,541 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:40:17,541 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:40:17,541 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:40:17,541 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:40:17,542 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:40:17,542 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:40:17,542 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:40:17,542 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:40:17,543 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:40:17,543 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:40:17,543 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:40:17,543 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:40:17,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:40:17,544 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:40:17,544 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:40:17,544 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_9165fa7b-1972-45a4-92bc-dcf663867b5f/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 -> 9eb992f5fc2d1a4c635ca3f801d15ea699dd32d7 [2019-11-26 02:40:17,725 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:40:17,737 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:40:17,739 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:40:17,741 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:40:17,741 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:40:17,742 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9165fa7b-1972-45a4-92bc-dcf663867b5f/bin/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c [2019-11-26 02:40:17,805 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9165fa7b-1972-45a4-92bc-dcf663867b5f/bin/utaipan/data/fc4c81229/365a348e4d434c26b2f47fc0af34cd78/FLAG0e58e5671 [2019-11-26 02:40:18,318 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:40:18,319 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9165fa7b-1972-45a4-92bc-dcf663867b5f/sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c [2019-11-26 02:40:18,354 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9165fa7b-1972-45a4-92bc-dcf663867b5f/bin/utaipan/data/fc4c81229/365a348e4d434c26b2f47fc0af34cd78/FLAG0e58e5671 [2019-11-26 02:40:18,774 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9165fa7b-1972-45a4-92bc-dcf663867b5f/bin/utaipan/data/fc4c81229/365a348e4d434c26b2f47fc0af34cd78 [2019-11-26 02:40:18,777 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:40:18,778 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:40:18,779 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:40:18,779 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:40:18,792 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:40:18,793 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:40:18" (1/1) ... [2019-11-26 02:40:18,795 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b873474 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:40:18, skipping insertion in model container [2019-11-26 02:40:18,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:40:18" (1/1) ... [2019-11-26 02:40:18,801 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:40:18,894 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:40:19,445 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:40:19,460 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:40:19,617 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:40:19,643 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:40:19,644 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:40:19 WrapperNode [2019-11-26 02:40:19,644 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:40:19,645 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:40:19,645 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:40:19,645 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:40:19,652 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:40:19" (1/1) ... [2019-11-26 02:40:19,691 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:40:19" (1/1) ... [2019-11-26 02:40:19,760 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:40:19,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:40:19,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:40:19,761 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:40:19,769 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:40:19" (1/1) ... [2019-11-26 02:40:19,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:40:19" (1/1) ... [2019-11-26 02:40:19,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:40:19" (1/1) ... [2019-11-26 02:40:19,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:40:19" (1/1) ... [2019-11-26 02:40:19,826 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:40:19" (1/1) ... [2019-11-26 02:40:19,838 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:40:19" (1/1) ... [2019-11-26 02:40:19,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:40:19" (1/1) ... [2019-11-26 02:40:19,854 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:40:19,855 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:40:19,855 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:40:19,855 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:40:19,856 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:40:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9165fa7b-1972-45a4-92bc-dcf663867b5f/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:40:19,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-26 02:40:19,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-26 02:40:19,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 02:40:19,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-26 02:40:19,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-26 02:40:19,910 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-26 02:40:19,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-26 02:40:19,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-26 02:40:19,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:40:19,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:40:20,110 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-26 02:40:20,988 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##87: assume false; [2019-11-26 02:40:20,988 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##88: assume !false; [2019-11-26 02:40:21,733 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:40:21,734 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-26 02:40:21,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:40:21 BoogieIcfgContainer [2019-11-26 02:40:21,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:40:21,736 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:40:21,736 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:40:21,740 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:40:21,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:40:18" (1/3) ... [2019-11-26 02:40:21,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d2bd27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:40:21, skipping insertion in model container [2019-11-26 02:40:21,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:40:19" (2/3) ... [2019-11-26 02:40:21,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75d2bd27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:40:21, skipping insertion in model container [2019-11-26 02:40:21,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:40:21" (3/3) ... [2019-11-26 02:40:21,744 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr.blast.01.i.cil-2.c [2019-11-26 02:40:21,754 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:40:21,762 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-26 02:40:21,773 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-26 02:40:21,800 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:40:21,800 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:40:21,800 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:40:21,800 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:40:21,800 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:40:21,801 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:40:21,801 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:40:21,801 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:40:21,828 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states. [2019-11-26 02:40:21,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-26 02:40:21,840 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:40:21,841 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:40:21,841 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:40:21,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:40:21,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1692138470, now seen corresponding path program 1 times [2019-11-26 02:40:21,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:40:21,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215104326] [2019-11-26 02:40:21,857 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:40:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:22,209 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:40:22,211 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215104326] [2019-11-26 02:40:22,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:40:22,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:40:22,213 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261729484] [2019-11-26 02:40:22,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:40:22,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:40:22,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:40:22,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:40:22,233 INFO L87 Difference]: Start difference. First operand 109 states. Second operand 4 states. [2019-11-26 02:40:22,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:40:22,677 INFO L93 Difference]: Finished difference Result 241 states and 413 transitions. [2019-11-26 02:40:22,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:40:22,680 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-11-26 02:40:22,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:40:22,701 INFO L225 Difference]: With dead ends: 241 [2019-11-26 02:40:22,701 INFO L226 Difference]: Without dead ends: 128 [2019-11-26 02:40:22,705 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:40:22,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-26 02:40:22,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 116. [2019-11-26 02:40:22,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-26 02:40:22,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 177 transitions. [2019-11-26 02:40:22,742 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 177 transitions. Word has length 39 [2019-11-26 02:40:22,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:40:22,743 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 177 transitions. [2019-11-26 02:40:22,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:40:22,743 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 177 transitions. [2019-11-26 02:40:22,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-26 02:40:22,746 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:40:22,746 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, 1] [2019-11-26 02:40:22,746 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:40:22,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:40:22,747 INFO L82 PathProgramCache]: Analyzing trace with hash -1286717670, now seen corresponding path program 1 times [2019-11-26 02:40:22,747 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:40:22,749 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360701644] [2019-11-26 02:40:22,749 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:40:22,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:22,938 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:40:22,938 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360701644] [2019-11-26 02:40:22,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:40:22,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:40:22,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902236198] [2019-11-26 02:40:22,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:40:22,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:40:22,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:40:22,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:40:22,941 INFO L87 Difference]: Start difference. First operand 116 states and 177 transitions. Second operand 4 states. [2019-11-26 02:40:23,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:40:23,251 INFO L93 Difference]: Finished difference Result 232 states and 348 transitions. [2019-11-26 02:40:23,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:40:23,252 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2019-11-26 02:40:23,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:40:23,254 INFO L225 Difference]: With dead ends: 232 [2019-11-26 02:40:23,254 INFO L226 Difference]: Without dead ends: 128 [2019-11-26 02:40:23,255 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:40:23,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-26 02:40:23,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 116. [2019-11-26 02:40:23,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-26 02:40:23,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 176 transitions. [2019-11-26 02:40:23,276 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 176 transitions. Word has length 50 [2019-11-26 02:40:23,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:40:23,277 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 176 transitions. [2019-11-26 02:40:23,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:40:23,277 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 176 transitions. [2019-11-26 02:40:23,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-26 02:40:23,279 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:40:23,279 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:40:23,279 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:40:23,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:40:23,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1020577846, now seen corresponding path program 1 times [2019-11-26 02:40:23,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:40:23,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541441389] [2019-11-26 02:40:23,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:40:23,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:23,358 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:40:23,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541441389] [2019-11-26 02:40:23,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:40:23,358 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:40:23,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564075005] [2019-11-26 02:40:23,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:40:23,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:40:23,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:40:23,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:40:23,360 INFO L87 Difference]: Start difference. First operand 116 states and 176 transitions. Second operand 4 states. [2019-11-26 02:40:23,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:40:23,626 INFO L93 Difference]: Finished difference Result 232 states and 347 transitions. [2019-11-26 02:40:23,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:40:23,627 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-26 02:40:23,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:40:23,628 INFO L225 Difference]: With dead ends: 232 [2019-11-26 02:40:23,629 INFO L226 Difference]: Without dead ends: 128 [2019-11-26 02:40:23,630 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:40:23,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-26 02:40:23,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 116. [2019-11-26 02:40:23,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-26 02:40:23,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 175 transitions. [2019-11-26 02:40:23,638 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 175 transitions. Word has length 51 [2019-11-26 02:40:23,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:40:23,639 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 175 transitions. [2019-11-26 02:40:23,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:40:23,639 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 175 transitions. [2019-11-26 02:40:23,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-26 02:40:23,641 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:40:23,641 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:40:23,641 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:40:23,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:40:23,642 INFO L82 PathProgramCache]: Analyzing trace with hash 502927615, now seen corresponding path program 1 times [2019-11-26 02:40:23,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:40:23,642 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036625869] [2019-11-26 02:40:23,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:40:23,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:23,726 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:40:23,726 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036625869] [2019-11-26 02:40:23,726 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:40:23,726 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:40:23,727 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276655358] [2019-11-26 02:40:23,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:40:23,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:40:23,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:40:23,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:40:23,728 INFO L87 Difference]: Start difference. First operand 116 states and 175 transitions. Second operand 4 states. [2019-11-26 02:40:23,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:40:23,986 INFO L93 Difference]: Finished difference Result 232 states and 346 transitions. [2019-11-26 02:40:23,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:40:23,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-26 02:40:23,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:40:23,988 INFO L225 Difference]: With dead ends: 232 [2019-11-26 02:40:23,988 INFO L226 Difference]: Without dead ends: 128 [2019-11-26 02:40:23,989 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:40:23,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-26 02:40:24,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 116. [2019-11-26 02:40:24,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-26 02:40:24,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 174 transitions. [2019-11-26 02:40:24,002 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 174 transitions. Word has length 51 [2019-11-26 02:40:24,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:40:24,002 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 174 transitions. [2019-11-26 02:40:24,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:40:24,003 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 174 transitions. [2019-11-26 02:40:24,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-26 02:40:24,004 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:40:24,004 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, 1] [2019-11-26 02:40:24,004 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:40:24,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:40:24,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1458618501, now seen corresponding path program 1 times [2019-11-26 02:40:24,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:40:24,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382475632] [2019-11-26 02:40:24,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:40:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:24,066 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:40:24,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382475632] [2019-11-26 02:40:24,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:40:24,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:40:24,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189062112] [2019-11-26 02:40:24,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:40:24,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:40:24,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:40:24,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:40:24,068 INFO L87 Difference]: Start difference. First operand 116 states and 174 transitions. Second operand 4 states. [2019-11-26 02:40:24,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:40:24,332 INFO L93 Difference]: Finished difference Result 232 states and 345 transitions. [2019-11-26 02:40:24,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:40:24,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2019-11-26 02:40:24,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:40:24,334 INFO L225 Difference]: With dead ends: 232 [2019-11-26 02:40:24,334 INFO L226 Difference]: Without dead ends: 128 [2019-11-26 02:40:24,335 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:40:24,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-26 02:40:24,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 116. [2019-11-26 02:40:24,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-26 02:40:24,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 173 transitions. [2019-11-26 02:40:24,342 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 173 transitions. Word has length 51 [2019-11-26 02:40:24,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:40:24,343 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 173 transitions. [2019-11-26 02:40:24,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:40:24,343 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 173 transitions. [2019-11-26 02:40:24,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-26 02:40:24,344 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:40:24,344 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, 1] [2019-11-26 02:40:24,344 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:40:24,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:40:24,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1231188120, now seen corresponding path program 1 times [2019-11-26 02:40:24,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:40:24,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934045699] [2019-11-26 02:40:24,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:40:24,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:24,409 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:40:24,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934045699] [2019-11-26 02:40:24,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:40:24,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:40:24,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861281640] [2019-11-26 02:40:24,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:40:24,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:40:24,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:40:24,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:40:24,411 INFO L87 Difference]: Start difference. First operand 116 states and 173 transitions. Second operand 4 states. [2019-11-26 02:40:24,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:40:24,651 INFO L93 Difference]: Finished difference Result 232 states and 344 transitions. [2019-11-26 02:40:24,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:40:24,654 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-26 02:40:24,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:40:24,655 INFO L225 Difference]: With dead ends: 232 [2019-11-26 02:40:24,655 INFO L226 Difference]: Without dead ends: 128 [2019-11-26 02:40:24,655 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:40:24,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2019-11-26 02:40:24,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 116. [2019-11-26 02:40:24,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-26 02:40:24,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 172 transitions. [2019-11-26 02:40:24,661 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 172 transitions. Word has length 52 [2019-11-26 02:40:24,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:40:24,662 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 172 transitions. [2019-11-26 02:40:24,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:40:24,662 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 172 transitions. [2019-11-26 02:40:24,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-26 02:40:24,663 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:40:24,663 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:40:24,663 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:40:24,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:40:24,664 INFO L82 PathProgramCache]: Analyzing trace with hash -1105702665, now seen corresponding path program 1 times [2019-11-26 02:40:24,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:40:24,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899232555] [2019-11-26 02:40:24,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:40:24,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:24,712 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:40:24,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899232555] [2019-11-26 02:40:24,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:40:24,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:40:24,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088263232] [2019-11-26 02:40:24,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:40:24,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:40:24,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:40:24,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:40:24,714 INFO L87 Difference]: Start difference. First operand 116 states and 172 transitions. Second operand 4 states. [2019-11-26 02:40:24,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:40:24,949 INFO L93 Difference]: Finished difference Result 230 states and 341 transitions. [2019-11-26 02:40:24,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:40:24,951 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-26 02:40:24,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:40:24,952 INFO L225 Difference]: With dead ends: 230 [2019-11-26 02:40:24,952 INFO L226 Difference]: Without dead ends: 126 [2019-11-26 02:40:24,952 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:40:24,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-26 02:40:24,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 116. [2019-11-26 02:40:24,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-26 02:40:24,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 171 transitions. [2019-11-26 02:40:24,957 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 171 transitions. Word has length 52 [2019-11-26 02:40:24,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:40:24,958 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 171 transitions. [2019-11-26 02:40:24,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:40:24,958 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 171 transitions. [2019-11-26 02:40:24,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-26 02:40:24,959 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:40:24,959 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, 1] [2019-11-26 02:40:24,959 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:40:24,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:40:24,959 INFO L82 PathProgramCache]: Analyzing trace with hash -1506018208, now seen corresponding path program 1 times [2019-11-26 02:40:24,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:40:24,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984174654] [2019-11-26 02:40:24,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:40:24,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:25,013 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:40:25,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984174654] [2019-11-26 02:40:25,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:40:25,014 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:40:25,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881401674] [2019-11-26 02:40:25,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:40:25,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:40:25,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:40:25,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:40:25,015 INFO L87 Difference]: Start difference. First operand 116 states and 171 transitions. Second operand 4 states. [2019-11-26 02:40:25,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:40:25,317 INFO L93 Difference]: Finished difference Result 230 states and 340 transitions. [2019-11-26 02:40:25,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:40:25,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-11-26 02:40:25,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:40:25,319 INFO L225 Difference]: With dead ends: 230 [2019-11-26 02:40:25,319 INFO L226 Difference]: Without dead ends: 126 [2019-11-26 02:40:25,320 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:40:25,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2019-11-26 02:40:25,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 116. [2019-11-26 02:40:25,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-26 02:40:25,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 170 transitions. [2019-11-26 02:40:25,324 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 170 transitions. Word has length 53 [2019-11-26 02:40:25,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:40:25,324 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 170 transitions. [2019-11-26 02:40:25,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:40:25,325 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 170 transitions. [2019-11-26 02:40:25,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-26 02:40:25,328 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:40:25,328 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, 1] [2019-11-26 02:40:25,328 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:40:25,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:40:25,329 INFO L82 PathProgramCache]: Analyzing trace with hash -171053651, now seen corresponding path program 1 times [2019-11-26 02:40:25,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:40:25,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811725687] [2019-11-26 02:40:25,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:40:25,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:25,379 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:40:25,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811725687] [2019-11-26 02:40:25,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:40:25,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-26 02:40:25,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848943292] [2019-11-26 02:40:25,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:40:25,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:40:25,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:40:25,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:40:25,381 INFO L87 Difference]: Start difference. First operand 116 states and 170 transitions. Second operand 4 states. [2019-11-26 02:40:25,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:40:25,633 INFO L93 Difference]: Finished difference Result 222 states and 329 transitions. [2019-11-26 02:40:25,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:40:25,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-11-26 02:40:25,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:40:25,635 INFO L225 Difference]: With dead ends: 222 [2019-11-26 02:40:25,635 INFO L226 Difference]: Without dead ends: 118 [2019-11-26 02:40:25,636 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:40:25,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-26 02:40:25,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 116. [2019-11-26 02:40:25,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-11-26 02:40:25,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 169 transitions. [2019-11-26 02:40:25,640 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 169 transitions. Word has length 54 [2019-11-26 02:40:25,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:40:25,640 INFO L462 AbstractCegarLoop]: Abstraction has 116 states and 169 transitions. [2019-11-26 02:40:25,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:40:25,640 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 169 transitions. [2019-11-26 02:40:25,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-26 02:40:25,644 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:40:25,646 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:40:25,647 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:40:25,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:40:25,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1379040998, now seen corresponding path program 1 times [2019-11-26 02:40:25,648 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:40:25,648 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469078968] [2019-11-26 02:40:25,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:40:25,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:25,720 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:40:25,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469078968] [2019-11-26 02:40:25,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:40:25,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:40:25,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70630965] [2019-11-26 02:40:25,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:40:25,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:40:25,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:40:25,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:40:25,722 INFO L87 Difference]: Start difference. First operand 116 states and 169 transitions. Second operand 4 states. [2019-11-26 02:40:26,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:40:26,041 INFO L93 Difference]: Finished difference Result 254 states and 377 transitions. [2019-11-26 02:40:26,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:40:26,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 54 [2019-11-26 02:40:26,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:40:26,044 INFO L225 Difference]: With dead ends: 254 [2019-11-26 02:40:26,044 INFO L226 Difference]: Without dead ends: 150 [2019-11-26 02:40:26,044 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:40:26,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-26 02:40:26,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 136. [2019-11-26 02:40:26,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-26 02:40:26,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 203 transitions. [2019-11-26 02:40:26,050 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 203 transitions. Word has length 54 [2019-11-26 02:40:26,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:40:26,050 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 203 transitions. [2019-11-26 02:40:26,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:40:26,051 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 203 transitions. [2019-11-26 02:40:26,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-11-26 02:40:26,052 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:40:26,052 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, 1] [2019-11-26 02:40:26,052 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:40:26,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:40:26,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1910459598, now seen corresponding path program 1 times [2019-11-26 02:40:26,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:40:26,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186798022] [2019-11-26 02:40:26,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:40:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:26,103 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:40:26,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186798022] [2019-11-26 02:40:26,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:40:26,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:40:26,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781927194] [2019-11-26 02:40:26,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:40:26,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:40:26,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:40:26,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:40:26,105 INFO L87 Difference]: Start difference. First operand 136 states and 203 transitions. Second operand 4 states. [2019-11-26 02:40:26,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:40:26,449 INFO L93 Difference]: Finished difference Result 274 states and 410 transitions. [2019-11-26 02:40:26,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:40:26,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-11-26 02:40:26,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:40:26,452 INFO L225 Difference]: With dead ends: 274 [2019-11-26 02:40:26,452 INFO L226 Difference]: Without dead ends: 150 [2019-11-26 02:40:26,452 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:40:26,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-26 02:40:26,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 136. [2019-11-26 02:40:26,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-26 02:40:26,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 202 transitions. [2019-11-26 02:40:26,459 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 202 transitions. Word has length 65 [2019-11-26 02:40:26,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:40:26,459 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 202 transitions. [2019-11-26 02:40:26,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:40:26,459 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 202 transitions. [2019-11-26 02:40:26,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-26 02:40:26,460 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:40:26,460 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:40:26,461 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:40:26,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:40:26,461 INFO L82 PathProgramCache]: Analyzing trace with hash -692330346, now seen corresponding path program 1 times [2019-11-26 02:40:26,461 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:40:26,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977119814] [2019-11-26 02:40:26,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:40:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:26,523 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:40:26,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977119814] [2019-11-26 02:40:26,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:40:26,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:40:26,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140623965] [2019-11-26 02:40:26,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:40:26,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:40:26,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:40:26,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:40:26,525 INFO L87 Difference]: Start difference. First operand 136 states and 202 transitions. Second operand 4 states. [2019-11-26 02:40:26,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:40:26,843 INFO L93 Difference]: Finished difference Result 274 states and 408 transitions. [2019-11-26 02:40:26,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:40:26,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-26 02:40:26,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:40:26,845 INFO L225 Difference]: With dead ends: 274 [2019-11-26 02:40:26,845 INFO L226 Difference]: Without dead ends: 150 [2019-11-26 02:40:26,846 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:40:26,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-26 02:40:26,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 136. [2019-11-26 02:40:26,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-26 02:40:26,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 201 transitions. [2019-11-26 02:40:26,851 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 201 transitions. Word has length 66 [2019-11-26 02:40:26,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:40:26,851 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 201 transitions. [2019-11-26 02:40:26,851 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:40:26,851 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 201 transitions. [2019-11-26 02:40:26,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-26 02:40:26,852 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:40:26,852 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:40:26,852 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:40:26,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:40:26,853 INFO L82 PathProgramCache]: Analyzing trace with hash 831175115, now seen corresponding path program 1 times [2019-11-26 02:40:26,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:40:26,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538529078] [2019-11-26 02:40:26,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:40:26,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:26,905 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:40:26,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538529078] [2019-11-26 02:40:26,906 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:40:26,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:40:26,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264608041] [2019-11-26 02:40:26,907 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:40:26,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:40:26,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:40:26,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:40:26,908 INFO L87 Difference]: Start difference. First operand 136 states and 201 transitions. Second operand 4 states. [2019-11-26 02:40:27,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:40:27,241 INFO L93 Difference]: Finished difference Result 274 states and 406 transitions. [2019-11-26 02:40:27,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:40:27,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-26 02:40:27,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:40:27,244 INFO L225 Difference]: With dead ends: 274 [2019-11-26 02:40:27,244 INFO L226 Difference]: Without dead ends: 150 [2019-11-26 02:40:27,244 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:40:27,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-11-26 02:40:27,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 136. [2019-11-26 02:40:27,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2019-11-26 02:40:27,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 200 transitions. [2019-11-26 02:40:27,249 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 200 transitions. Word has length 66 [2019-11-26 02:40:27,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:40:27,249 INFO L462 AbstractCegarLoop]: Abstraction has 136 states and 200 transitions. [2019-11-26 02:40:27,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:40:27,250 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 200 transitions. [2019-11-26 02:40:27,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-26 02:40:27,250 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:40:27,250 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:40:27,251 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:40:27,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:40:27,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1130371001, now seen corresponding path program 1 times [2019-11-26 02:40:27,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:40:27,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099968276] [2019-11-26 02:40:27,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:40:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:27,316 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:40:27,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099968276] [2019-11-26 02:40:27,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:40:27,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-26 02:40:27,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682176672] [2019-11-26 02:40:27,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-26 02:40:27,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:40:27,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-26 02:40:27,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:40:27,318 INFO L87 Difference]: Start difference. First operand 136 states and 200 transitions. Second operand 5 states. [2019-11-26 02:40:27,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:40:27,781 INFO L93 Difference]: Finished difference Result 277 states and 411 transitions. [2019-11-26 02:40:27,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:40:27,782 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-26 02:40:27,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:40:27,783 INFO L225 Difference]: With dead ends: 277 [2019-11-26 02:40:27,783 INFO L226 Difference]: Without dead ends: 153 [2019-11-26 02:40:27,784 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:40:27,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2019-11-26 02:40:27,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2019-11-26 02:40:27,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-26 02:40:27,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 220 transitions. [2019-11-26 02:40:27,790 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 220 transitions. Word has length 66 [2019-11-26 02:40:27,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:40:27,790 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 220 transitions. [2019-11-26 02:40:27,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-26 02:40:27,790 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 220 transitions. [2019-11-26 02:40:27,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-26 02:40:27,791 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:40:27,791 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:40:27,791 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:40:27,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:40:27,792 INFO L82 PathProgramCache]: Analyzing trace with hash 480035243, now seen corresponding path program 1 times [2019-11-26 02:40:27,792 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:40:27,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094324553] [2019-11-26 02:40:27,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:40:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:27,857 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:40:27,857 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094324553] [2019-11-26 02:40:27,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:40:27,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:40:27,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049475792] [2019-11-26 02:40:27,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:40:27,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:40:27,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:40:27,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:40:27,859 INFO L87 Difference]: Start difference. First operand 152 states and 220 transitions. Second operand 4 states. [2019-11-26 02:40:28,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:40:28,219 INFO L93 Difference]: Finished difference Result 304 states and 441 transitions. [2019-11-26 02:40:28,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:40:28,221 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-26 02:40:28,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:40:28,222 INFO L225 Difference]: With dead ends: 304 [2019-11-26 02:40:28,222 INFO L226 Difference]: Without dead ends: 164 [2019-11-26 02:40:28,223 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:40:28,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-26 02:40:28,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 152. [2019-11-26 02:40:28,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-26 02:40:28,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 219 transitions. [2019-11-26 02:40:28,229 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 219 transitions. Word has length 67 [2019-11-26 02:40:28,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:40:28,229 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 219 transitions. [2019-11-26 02:40:28,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:40:28,229 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 219 transitions. [2019-11-26 02:40:28,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-26 02:40:28,230 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:40:28,230 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, 1] [2019-11-26 02:40:28,230 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:40:28,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:40:28,231 INFO L82 PathProgramCache]: Analyzing trace with hash 564365713, now seen corresponding path program 1 times [2019-11-26 02:40:28,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:40:28,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070969485] [2019-11-26 02:40:28,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:40:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:28,291 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:40:28,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070969485] [2019-11-26 02:40:28,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:40:28,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:40:28,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139865187] [2019-11-26 02:40:28,292 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:40:28,292 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:40:28,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:40:28,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:40:28,293 INFO L87 Difference]: Start difference. First operand 152 states and 219 transitions. Second operand 4 states. [2019-11-26 02:40:28,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:40:28,633 INFO L93 Difference]: Finished difference Result 304 states and 439 transitions. [2019-11-26 02:40:28,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:40:28,635 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-11-26 02:40:28,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:40:28,636 INFO L225 Difference]: With dead ends: 304 [2019-11-26 02:40:28,636 INFO L226 Difference]: Without dead ends: 164 [2019-11-26 02:40:28,637 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:40:28,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-26 02:40:28,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 152. [2019-11-26 02:40:28,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-26 02:40:28,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 218 transitions. [2019-11-26 02:40:28,643 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 218 transitions. Word has length 67 [2019-11-26 02:40:28,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:40:28,644 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 218 transitions. [2019-11-26 02:40:28,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:40:28,644 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 218 transitions. [2019-11-26 02:40:28,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-11-26 02:40:28,645 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:40:28,645 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, 1] [2019-11-26 02:40:28,645 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:40:28,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:40:28,646 INFO L82 PathProgramCache]: Analyzing trace with hash -647730084, now seen corresponding path program 1 times [2019-11-26 02:40:28,646 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:40:28,646 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272752680] [2019-11-26 02:40:28,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:40:28,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:28,690 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:40:28,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272752680] [2019-11-26 02:40:28,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:40:28,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:40:28,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453076016] [2019-11-26 02:40:28,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:40:28,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:40:28,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:40:28,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:40:28,692 INFO L87 Difference]: Start difference. First operand 152 states and 218 transitions. Second operand 4 states. [2019-11-26 02:40:29,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:40:29,073 INFO L93 Difference]: Finished difference Result 304 states and 437 transitions. [2019-11-26 02:40:29,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:40:29,074 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 68 [2019-11-26 02:40:29,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:40:29,076 INFO L225 Difference]: With dead ends: 304 [2019-11-26 02:40:29,076 INFO L226 Difference]: Without dead ends: 164 [2019-11-26 02:40:29,076 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:40:29,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-26 02:40:29,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 152. [2019-11-26 02:40:29,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-26 02:40:29,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 217 transitions. [2019-11-26 02:40:29,085 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 217 transitions. Word has length 68 [2019-11-26 02:40:29,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:40:29,087 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 217 transitions. [2019-11-26 02:40:29,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:40:29,087 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 217 transitions. [2019-11-26 02:40:29,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-11-26 02:40:29,088 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:40:29,088 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, 1] [2019-11-26 02:40:29,089 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:40:29,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:40:29,089 INFO L82 PathProgramCache]: Analyzing trace with hash 984943692, now seen corresponding path program 1 times [2019-11-26 02:40:29,089 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:40:29,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370687418] [2019-11-26 02:40:29,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:40:29,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:29,146 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:40:29,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370687418] [2019-11-26 02:40:29,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:40:29,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:40:29,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718141269] [2019-11-26 02:40:29,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:40:29,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:40:29,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:40:29,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:40:29,153 INFO L87 Difference]: Start difference. First operand 152 states and 217 transitions. Second operand 4 states. [2019-11-26 02:40:29,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:40:29,449 INFO L93 Difference]: Finished difference Result 304 states and 435 transitions. [2019-11-26 02:40:29,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:40:29,450 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-11-26 02:40:29,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:40:29,452 INFO L225 Difference]: With dead ends: 304 [2019-11-26 02:40:29,452 INFO L226 Difference]: Without dead ends: 164 [2019-11-26 02:40:29,452 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:40:29,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-11-26 02:40:29,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 152. [2019-11-26 02:40:29,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-26 02:40:29,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 216 transitions. [2019-11-26 02:40:29,458 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 216 transitions. Word has length 69 [2019-11-26 02:40:29,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:40:29,458 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 216 transitions. [2019-11-26 02:40:29,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:40:29,458 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 216 transitions. [2019-11-26 02:40:29,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-11-26 02:40:29,459 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:40:29,459 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, 1] [2019-11-26 02:40:29,459 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:40:29,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:40:29,460 INFO L82 PathProgramCache]: Analyzing trace with hash 611161015, now seen corresponding path program 1 times [2019-11-26 02:40:29,460 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:40:29,460 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278036697] [2019-11-26 02:40:29,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:40:29,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:29,503 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:40:29,503 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278036697] [2019-11-26 02:40:29,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:40:29,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-26 02:40:29,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479276675] [2019-11-26 02:40:29,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:40:29,504 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:40:29,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:40:29,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:40:29,505 INFO L87 Difference]: Start difference. First operand 152 states and 216 transitions. Second operand 4 states. [2019-11-26 02:40:29,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:40:29,821 INFO L93 Difference]: Finished difference Result 296 states and 424 transitions. [2019-11-26 02:40:29,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:40:29,822 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-11-26 02:40:29,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:40:29,824 INFO L225 Difference]: With dead ends: 296 [2019-11-26 02:40:29,824 INFO L226 Difference]: Without dead ends: 156 [2019-11-26 02:40:29,824 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:40:29,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-11-26 02:40:29,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 152. [2019-11-26 02:40:29,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2019-11-26 02:40:29,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 215 transitions. [2019-11-26 02:40:29,830 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 215 transitions. Word has length 70 [2019-11-26 02:40:29,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:40:29,830 INFO L462 AbstractCegarLoop]: Abstraction has 152 states and 215 transitions. [2019-11-26 02:40:29,830 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:40:29,830 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 215 transitions. [2019-11-26 02:40:29,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-26 02:40:29,831 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:40:29,831 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:40:29,831 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:40:29,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:40:29,831 INFO L82 PathProgramCache]: Analyzing trace with hash -1309007482, now seen corresponding path program 1 times [2019-11-26 02:40:29,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:40:29,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982991071] [2019-11-26 02:40:29,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:40:29,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:29,919 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:40:29,919 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982991071] [2019-11-26 02:40:29,920 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170228886] [2019-11-26 02:40:29,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9165fa7b-1972-45a4-92bc-dcf663867b5f/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:40:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:30,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-26 02:40:30,098 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:40:30,118 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:40:30,118 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:40:30,138 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:40:30,152 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:40:30,166 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:40:30,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-26 02:40:30,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4, 4] total 5 [2019-11-26 02:40:30,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310347030] [2019-11-26 02:40:30,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:40:30,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:40:30,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:40:30,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:40:30,172 INFO L87 Difference]: Start difference. First operand 152 states and 215 transitions. Second operand 3 states. [2019-11-26 02:40:30,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:40:30,208 INFO L93 Difference]: Finished difference Result 289 states and 415 transitions. [2019-11-26 02:40:30,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:40:30,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-11-26 02:40:30,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:40:30,211 INFO L225 Difference]: With dead ends: 289 [2019-11-26 02:40:30,211 INFO L226 Difference]: Without dead ends: 287 [2019-11-26 02:40:30,211 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 140 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:40:30,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2019-11-26 02:40:30,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2019-11-26 02:40:30,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2019-11-26 02:40:30,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 409 transitions. [2019-11-26 02:40:30,227 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 409 transitions. Word has length 72 [2019-11-26 02:40:30,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:40:30,227 INFO L462 AbstractCegarLoop]: Abstraction has 284 states and 409 transitions. [2019-11-26 02:40:30,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:40:30,227 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 409 transitions. [2019-11-26 02:40:30,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-11-26 02:40:30,229 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:40:30,229 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:40:30,434 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:40:30,434 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:40:30,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:40:30,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1192587038, now seen corresponding path program 1 times [2019-11-26 02:40:30,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:40:30,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123887369] [2019-11-26 02:40:30,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:40:30,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:30,615 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:40:30,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123887369] [2019-11-26 02:40:30,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [381426491] [2019-11-26 02:40:30,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9165fa7b-1972-45a4-92bc-dcf663867b5f/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-11-26 02:40:30,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:30,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-26 02:40:30,815 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:40:30,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:40:30,874 INFO L392 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_320|, |v_#memory_$Pointer$.base_321|, |v_#memory_$Pointer$.offset_321|, |v_#memory_$Pointer$.base_320|, v_prenex_1, v_prenex_2, v_prenex_3, v_prenex_4], 4=[|v_#memory_int_323|, v_prenex_5]} [2019-11-26 02:40:30,889 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:40:30,955 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:40:30,973 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 29 [2019-11-26 02:40:30,975 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:40:31,015 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:40:31,015 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_321| vanished before elimination [2019-11-26 02:40:31,016 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_320| vanished before elimination [2019-11-26 02:40:31,027 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 02:40:31,061 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:40:31,068 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 28 [2019-11-26 02:40:31,068 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 02:40:31,096 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:40:31,096 INFO L464 ElimStorePlain]: Eliminatee v_prenex_3 vanished before elimination [2019-11-26 02:40:31,096 INFO L464 ElimStorePlain]: Eliminatee v_prenex_4 vanished before elimination [2019-11-26 02:40:31,106 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:40:31,108 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:40:31,113 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:40:31,125 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2019-11-26 02:40:31,126 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 02:40:31,153 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:40:31,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:40:31,160 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:40:31,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:40:31,168 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2019-11-26 02:40:31,169 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 02:40:31,189 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:40:31,189 INFO L496 ElimStorePlain]: Start of recursive call 1: 10 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-26 02:40:31,189 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:134, output treesize:58 [2019-11-26 02:40:31,334 INFO L343 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2019-11-26 02:40:31,334 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 14 [2019-11-26 02:40:31,335 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:40:31,337 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:40:31,337 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:40:31,337 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2019-11-26 02:40:31,388 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-26 02:40:31,388 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:40:31,478 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-26 02:40:31,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-26 02:40:31,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [5] total 13 [2019-11-26 02:40:31,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285485429] [2019-11-26 02:40:31,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 02:40:31,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:40:31,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 02:40:31,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-11-26 02:40:31,480 INFO L87 Difference]: Start difference. First operand 284 states and 409 transitions. Second operand 9 states. [2019-11-26 02:40:33,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:40:33,478 INFO L93 Difference]: Finished difference Result 836 states and 1229 transitions. [2019-11-26 02:40:33,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:40:33,480 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 107 [2019-11-26 02:40:33,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:40:33,483 INFO L225 Difference]: With dead ends: 836 [2019-11-26 02:40:33,483 INFO L226 Difference]: Without dead ends: 564 [2019-11-26 02:40:33,484 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-11-26 02:40:33,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2019-11-26 02:40:33,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 357. [2019-11-26 02:40:33,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2019-11-26 02:40:33,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 547 transitions. [2019-11-26 02:40:33,502 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 547 transitions. Word has length 107 [2019-11-26 02:40:33,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:40:33,502 INFO L462 AbstractCegarLoop]: Abstraction has 357 states and 547 transitions. [2019-11-26 02:40:33,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 02:40:33,502 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 547 transitions. [2019-11-26 02:40:33,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-26 02:40:33,504 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:40:33,504 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:40:33,708 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:40:33,708 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:40:33,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:40:33,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1677382394, now seen corresponding path program 1 times [2019-11-26 02:40:33,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:40:33,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327326369] [2019-11-26 02:40:33,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:40:33,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:33,826 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:40:33,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327326369] [2019-11-26 02:40:33,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155865547] [2019-11-26 02:40:33,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9165fa7b-1972-45a4-92bc-dcf663867b5f/bin/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:40:34,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:34,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-26 02:40:34,020 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:40:34,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:40:34,030 INFO L392 ElimStorePlain]: Different costs {0=[v_prenex_8, |v_#memory_$Pointer$.offset_323|, v_prenex_10, |v_#memory_$Pointer$.base_324|, |v_#memory_$Pointer$.base_323|, |v_#memory_$Pointer$.offset_324|, v_prenex_6, v_prenex_7], 4=[v_prenex_9, |v_#memory_int_326|]} [2019-11-26 02:40:34,037 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:40:34,089 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:40:34,093 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-26 02:40:34,149 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:40:34,156 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 28 [2019-11-26 02:40:34,157 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-26 02:40:34,195 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:40:34,208 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 29 [2019-11-26 02:40:34,208 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-26 02:40:34,237 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:40:34,237 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.base_323| vanished before elimination [2019-11-26 02:40:34,238 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_$Pointer$.offset_324| vanished before elimination [2019-11-26 02:40:34,238 INFO L464 ElimStorePlain]: Eliminatee v_prenex_6 vanished before elimination [2019-11-26 02:40:34,238 INFO L464 ElimStorePlain]: Eliminatee v_prenex_7 vanished before elimination [2019-11-26 02:40:34,244 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:40:34,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:40:34,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:40:34,262 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 31 [2019-11-26 02:40:34,263 INFO L496 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2019-11-26 02:40:34,283 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:40:34,288 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:40:34,289 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:40:34,290 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-26 02:40:34,301 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 32 [2019-11-26 02:40:34,302 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-11-26 02:40:34,329 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:40:34,330 INFO L496 ElimStorePlain]: Start of recursive call 1: 10 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-26 02:40:34,330 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 10 variables, input treesize:134, output treesize:58 [2019-11-26 02:40:34,503 INFO L343 Elim1Store]: treesize reduction 36, result has 2.7 percent of original size [2019-11-26 02:40:34,503 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 14 [2019-11-26 02:40:34,504 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-26 02:40:34,506 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-26 02:40:34,506 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-26 02:40:34,507 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:3 [2019-11-26 02:40:34,557 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-26 02:40:34,557 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:40:34,644 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-11-26 02:40:34,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-11-26 02:40:34,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 5] imperfect sequences [5] total 13 [2019-11-26 02:40:34,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211589476] [2019-11-26 02:40:34,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 02:40:34,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:40:34,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 02:40:34,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2019-11-26 02:40:34,647 INFO L87 Difference]: Start difference. First operand 357 states and 547 transitions. Second operand 9 states. [2019-11-26 02:40:36,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:40:36,315 INFO L93 Difference]: Finished difference Result 931 states and 1417 transitions. [2019-11-26 02:40:36,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:40:36,317 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 108 [2019-11-26 02:40:36,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:40:36,321 INFO L225 Difference]: With dead ends: 931 [2019-11-26 02:40:36,322 INFO L226 Difference]: Without dead ends: 580 [2019-11-26 02:40:36,323 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 207 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-11-26 02:40:36,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-11-26 02:40:36,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 383. [2019-11-26 02:40:36,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-11-26 02:40:36,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 599 transitions. [2019-11-26 02:40:36,339 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 599 transitions. Word has length 108 [2019-11-26 02:40:36,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:40:36,339 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 599 transitions. [2019-11-26 02:40:36,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 02:40:36,340 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 599 transitions. [2019-11-26 02:40:36,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-26 02:40:36,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:40:36,341 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:40:36,545 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:40:36,549 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:40:36,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:40:36,549 INFO L82 PathProgramCache]: Analyzing trace with hash -991109109, now seen corresponding path program 1 times [2019-11-26 02:40:36,549 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:40:36,549 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349509019] [2019-11-26 02:40:36,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:40:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:36,654 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:40:36,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349509019] [2019-11-26 02:40:36,655 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6065059] [2019-11-26 02:40:36,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_9165fa7b-1972-45a4-92bc-dcf663867b5f/bin/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:40:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:40:36,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-26 02:40:36,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:40:36,867 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 97 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:40:36,867 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:40:36,876 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:40:36,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:40:36,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:40:36,948 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 97 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:40:36,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-11-26 02:40:36,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 9 [2019-11-26 02:40:36,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942890516] [2019-11-26 02:40:36,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:40:36,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:40:36,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:40:36,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:40:36,950 INFO L87 Difference]: Start difference. First operand 383 states and 599 transitions. Second operand 6 states. [2019-11-26 02:40:37,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:40:37,057 INFO L93 Difference]: Finished difference Result 576 states and 891 transitions. [2019-11-26 02:40:37,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:40:37,057 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2019-11-26 02:40:37,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:40:37,061 INFO L225 Difference]: With dead ends: 576 [2019-11-26 02:40:37,061 INFO L226 Difference]: Without dead ends: 574 [2019-11-26 02:40:37,062 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 216 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:40:37,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-11-26 02:40:37,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 383. [2019-11-26 02:40:37,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2019-11-26 02:40:37,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 598 transitions. [2019-11-26 02:40:37,084 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 598 transitions. Word has length 111 [2019-11-26 02:40:37,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:40:37,085 INFO L462 AbstractCegarLoop]: Abstraction has 383 states and 598 transitions. [2019-11-26 02:40:37,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:40:37,085 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 598 transitions. [2019-11-26 02:40:37,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-26 02:40:37,087 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:40:37,087 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, 1] [2019-11-26 02:40:37,293 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-26 02:40:37,293 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:40:37,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:40:37,293 INFO L82 PathProgramCache]: Analyzing trace with hash -659611390, now seen corresponding path program 1 times [2019-11-26 02:40:37,293 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:40:37,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901925774] [2019-11-26 02:40:37,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:40:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:40:37,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:40:37,635 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-11-26 02:40:37,635 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-26 02:40:37,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:40:37 BoogieIcfgContainer [2019-11-26 02:40:37,770 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:40:37,770 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:40:37,771 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:40:37,771 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:40:37,771 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:40:21" (3/4) ... [2019-11-26 02:40:37,774 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-26 02:40:37,774 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:40:37,775 INFO L168 Benchmark]: Toolchain (without parser) took 18997.66 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 265.3 MB). Free memory was 940.7 MB in the beginning and 822.9 MB in the end (delta: 117.8 MB). Peak memory consumption was 383.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:40:37,776 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:40:37,776 INFO L168 Benchmark]: CACSL2BoogieTranslator took 865.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -137.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:40:37,777 INFO L168 Benchmark]: Boogie Procedure Inliner took 115.75 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-11-26 02:40:37,777 INFO L168 Benchmark]: Boogie Preprocessor took 94.06 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-11-26 02:40:37,777 INFO L168 Benchmark]: RCFGBuilder took 1880.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 904.2 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:40:37,778 INFO L168 Benchmark]: TraceAbstraction took 16034.18 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 158.9 MB). Free memory was 904.2 MB in the beginning and 822.9 MB in the end (delta: 81.3 MB). Peak memory consumption was 240.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:40:37,778 INFO L168 Benchmark]: Witness Printer took 4.04 ms. Allocated memory is still 1.3 GB. Free memory is still 822.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:40:37,780 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 865.23 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 106.4 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -137.2 MB). Peak memory consumption was 24.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 115.75 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. * Boogie Preprocessor took 94.06 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 1880.19 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 904.2 MB in the end (delta: 163.0 MB). Peak memory consumption was 163.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16034.18 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 158.9 MB). Free memory was 904.2 MB in the beginning and 822.9 MB in the end (delta: 81.3 MB). Peak memory consumption was 240.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.04 ms. Allocated memory is still 1.3 GB. Free memory is still 822.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1706]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseAnd at line 1120. 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 = (BUF_MEM *)__VERIFIER_nondet_ulong(); [L1082] unsigned long l ; [L1083] unsigned long Time ; [L1084] unsigned long tmp = __VERIFIER_nondet_long() ; [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 ; [L1095] int tmp___4 ; [L1096] int tmp___5 ; [L1097] int tmp___6 ; [L1098] int tmp___7 ; [L1099] long tmp___8 = __VERIFIER_nondet_long() ; [L1100] int tmp___9 ; [L1101] int tmp___10 ; [L1102] int blastFlag ; [L1106] blastFlag = 0 [L1107] s->hit=__VERIFIER_nondet_int () [L1108] s->state = 8464 [L1109] Time = tmp [L1110] cb = (void (*)())((void *)0) [L1111] ret = -1 [L1112] skip = 0 [L1113] got_new_session = 0 [L1114] EXPR s->info_callback [L1114] COND FALSE !((unsigned long )s->info_callback != (unsigned long )((void *)0)) [L1119] EXPR s->in_handshake [L1119] s->in_handshake += 1 [L1120] COND FALSE !(tmp___1 & 12288) [L1129] EXPR s->cert VAL [init=1, SSLv3_server_data={5:0}] [L1129] COND FALSE !((unsigned long )s->cert == (unsigned long )((void *)0)) [L1135] COND TRUE 1 [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1162] COND TRUE s->state == 8464 [L1318] s->shutdown = 0 [L1319] ret = __VERIFIER_nondet_int() [L1320] COND TRUE blastFlag == 0 [L1321] blastFlag = 1 VAL [init=1, SSLv3_server_data={5:0}] [L1325] COND FALSE !(ret <= 0) [L1330] got_new_session = 1 [L1331] s->state = 8496 [L1332] s->init_num = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={5:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1135] COND TRUE 1 [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1171] COND TRUE s->state == 8496 [L1336] ret = __VERIFIER_nondet_int() [L1337] COND TRUE blastFlag == 1 [L1338] blastFlag = 2 VAL [init=1, SSLv3_server_data={5:0}] [L1342] COND FALSE !(ret <= 0) [L1347] s->hit [L1347] COND TRUE s->hit [L1348] s->state = 8656 [L1352] s->init_num = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={5:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1135] COND TRUE 1 [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1171] COND FALSE !(s->state == 8496) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1174] COND FALSE !(s->state == 8497) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1177] COND FALSE !(s->state == 8512) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1180] COND FALSE !(s->state == 8513) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1183] COND FALSE !(s->state == 8528) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1186] COND FALSE !(s->state == 8529) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1189] COND FALSE !(s->state == 8544) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1192] COND FALSE !(s->state == 8545) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1195] COND FALSE !(s->state == 8560) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1198] COND FALSE !(s->state == 8561) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1201] COND FALSE !(s->state == 8448) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1204] COND FALSE !(s->state == 8576) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1207] COND FALSE !(s->state == 8577) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1210] COND FALSE !(s->state == 8592) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1213] COND FALSE !(s->state == 8593) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1216] COND FALSE !(s->state == 8608) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1219] COND FALSE !(s->state == 8609) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1222] COND FALSE !(s->state == 8640) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1225] COND FALSE !(s->state == 8641) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1228] COND TRUE s->state == 8656 [L1552] EXPR s->session [L1552] EXPR s->s3 [L1552] EXPR (s->s3)->tmp.new_cipher [L1552] (s->session)->cipher = (s->s3)->tmp.new_cipher [L1553] tmp___9 = __VERIFIER_nondet_int() [L1554] COND FALSE !(! tmp___9) [L1560] ret = __VERIFIER_nondet_int() [L1561] COND TRUE blastFlag == 2 [L1562] blastFlag = 5 VAL [init=1, SSLv3_server_data={5:0}] [L1566] COND FALSE !(ret <= 0) [L1571] s->state = 8672 [L1572] s->init_num = 0 [L1573] tmp___10 = __VERIFIER_nondet_int() [L1574] COND FALSE !(! tmp___10) VAL [init=1, SSLv3_server_data={5:0}] [L1665] EXPR s->s3 [L1665] EXPR (s->s3)->tmp.reuse_message VAL [init=1, SSLv3_server_data={5:0}] [L1665] COND FALSE !(! (s->s3)->tmp.reuse_message) [L1694] skip = 0 VAL [init=1, SSLv3_server_data={5:0}] [L1135] COND TRUE 1 [L1137] EXPR s->state [L1137] state = s->state [L1138] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1138] COND FALSE !(s->state == 12292) [L1141] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1141] COND FALSE !(s->state == 16384) [L1144] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1144] COND FALSE !(s->state == 8192) [L1147] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1147] COND FALSE !(s->state == 24576) [L1150] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1150] COND FALSE !(s->state == 8195) [L1153] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1153] COND FALSE !(s->state == 8480) [L1156] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1156] COND FALSE !(s->state == 8481) [L1159] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1159] COND FALSE !(s->state == 8482) [L1162] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1162] COND FALSE !(s->state == 8464) [L1165] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1165] COND FALSE !(s->state == 8465) [L1168] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1168] COND FALSE !(s->state == 8466) [L1171] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1171] COND FALSE !(s->state == 8496) [L1174] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1174] COND FALSE !(s->state == 8497) [L1177] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1177] COND FALSE !(s->state == 8512) [L1180] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1180] COND FALSE !(s->state == 8513) [L1183] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1183] COND FALSE !(s->state == 8528) [L1186] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1186] COND FALSE !(s->state == 8529) [L1189] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1189] COND FALSE !(s->state == 8544) [L1192] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1192] COND FALSE !(s->state == 8545) [L1195] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1195] COND FALSE !(s->state == 8560) [L1198] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1198] COND FALSE !(s->state == 8561) [L1201] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1201] COND FALSE !(s->state == 8448) [L1204] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1204] COND FALSE !(s->state == 8576) [L1207] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1207] COND FALSE !(s->state == 8577) [L1210] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1210] COND FALSE !(s->state == 8592) [L1213] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1213] COND FALSE !(s->state == 8593) [L1216] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1216] COND FALSE !(s->state == 8608) [L1219] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1219] COND FALSE !(s->state == 8609) [L1222] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1222] COND FALSE !(s->state == 8640) [L1225] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1225] COND FALSE !(s->state == 8641) [L1228] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1228] COND FALSE !(s->state == 8656) [L1231] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1231] COND FALSE !(s->state == 8657) [L1234] EXPR s->state VAL [init=1, SSLv3_server_data={5:0}] [L1234] COND TRUE s->state == 8672 [L1583] ret = __VERIFIER_nondet_int() [L1584] COND FALSE !(blastFlag == 4) VAL [init=1, SSLv3_server_data={5:0}] [L1587] COND TRUE blastFlag == 5 VAL [init=1, SSLv3_server_data={5:0}] [L1706] __VERIFIER_error() VAL [init=1, SSLv3_server_data={5:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 109 locations, 1 error locations. Result: UNSAFE, OverallTime: 15.9s, OverallIterations: 24, TraceHistogramMax: 4, AutomataDifference: 9.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3470 SDtfs, 1345 SDslu, 6032 SDs, 0 SdLazy, 4320 SolverSat, 291 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 901 GetRequests, 797 SyntacticMatches, 7 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=383occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 801 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2019 NumberOfCodeBlocks, 2019 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 2274 ConstructedInterpolants, 0 QuantifiedInterpolants, 956123 SizeOfPredicates, 18 NumberOfNonLiveVariables, 2010 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 31 InterpolantComputations, 25 PerfectInterpolantSequences, 778/1234 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:40:39,642 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:40:39,643 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:40:39,660 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:40:39,660 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:40:39,661 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:40:39,663 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:40:39,672 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:40:39,676 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:40:39,679 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:40:39,680 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:40:39,682 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:40:39,682 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:40:39,684 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:40:39,686 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:40:39,687 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:40:39,688 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:40:39,689 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:40:39,691 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:40:39,695 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:40:39,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:40:39,702 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:40:39,703 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:40:39,704 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:40:39,707 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:40:39,707 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:40:39,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:40:39,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:40:39,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:40:39,712 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:40:39,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:40:39,712 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:40:39,713 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:40:39,714 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:40:39,715 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:40:39,715 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:40:39,716 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:40:39,716 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:40:39,716 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:40:39,717 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:40:39,718 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:40:39,719 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_9165fa7b-1972-45a4-92bc-dcf663867b5f/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-11-26 02:40:39,745 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:40:39,745 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:40:39,746 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:40:39,746 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:40:39,746 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:40:39,747 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:40:39,747 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:40:39,747 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:40:39,747 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:40:39,748 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:40:39,748 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:40:39,749 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:40:39,749 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:40:39,749 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:40:39,749 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:40:39,749 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:40:39,750 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 02:40:39,750 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-26 02:40:39,750 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-26 02:40:39,750 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:40:39,751 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:40:39,751 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 02:40:39,751 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:40:39,751 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:40:39,752 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 02:40:39,752 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:40:39,752 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:40:39,752 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:40:39,753 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:40:39,753 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:40:39,753 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:40:39,753 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-11-26 02:40:39,754 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-26 02:40:39,754 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:40:39,754 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:40:39,754 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_9165fa7b-1972-45a4-92bc-dcf663867b5f/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 -> 9eb992f5fc2d1a4c635ca3f801d15ea699dd32d7 [2019-11-26 02:40:40,047 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:40:40,063 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:40:40,066 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:40:40,069 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:40:40,069 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:40:40,070 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_9165fa7b-1972-45a4-92bc-dcf663867b5f/bin/utaipan/../../sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c [2019-11-26 02:40:40,121 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9165fa7b-1972-45a4-92bc-dcf663867b5f/bin/utaipan/data/f63a72a5f/9cb75bd01d98456aa05cb8b5d19c950f/FLAGba6c2b02a [2019-11-26 02:40:40,691 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:40:40,692 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_9165fa7b-1972-45a4-92bc-dcf663867b5f/sv-benchmarks/c/ssh/s3_srvr.blast.01.i.cil-2.c [2019-11-26 02:40:40,721 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_9165fa7b-1972-45a4-92bc-dcf663867b5f/bin/utaipan/data/f63a72a5f/9cb75bd01d98456aa05cb8b5d19c950f/FLAGba6c2b02a [2019-11-26 02:40:41,088 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_9165fa7b-1972-45a4-92bc-dcf663867b5f/bin/utaipan/data/f63a72a5f/9cb75bd01d98456aa05cb8b5d19c950f [2019-11-26 02:40:41,091 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:40:41,092 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:40:41,093 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:40:41,093 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:40:41,096 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:40:41,097 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:40:41" (1/1) ... [2019-11-26 02:40:41,099 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@797f6813 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:40:41, skipping insertion in model container [2019-11-26 02:40:41,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:40:41" (1/1) ... [2019-11-26 02:40:41,106 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:40:41,177 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:40:41,581 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:40:41,582 INFO L968 CHandler]: at location: C: (SSL_METHOD *)((void *)0) [1038] [2019-11-26 02:40:41,582 INFO L969 CHandler]: current memory model: HoenickeLindenmann_4ByteResolution [2019-11-26 02:40:41,603 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:40:41,615 INFO L168 Benchmark]: Toolchain (without parser) took 522.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -161.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:40:41,616 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:40:41,617 INFO L168 Benchmark]: CACSL2BoogieTranslator took 520.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -161.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2019-11-26 02:40:41,619 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 520.35 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -161.2 MB). Peak memory consumption was 28.2 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...