./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_clnt_2.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_190b0d0b-6db3-4a06-a5fd-80a590d4a4e8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_190b0d0b-6db3-4a06-a5fd-80a590d4a4e8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_190b0d0b-6db3-4a06-a5fd-80a590d4a4e8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_190b0d0b-6db3-4a06-a5fd-80a590d4a4e8/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_2.cil-1.c -s /tmp/vcloud-vcloud-master/worker/working_dir_190b0d0b-6db3-4a06-a5fd-80a590d4a4e8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_190b0d0b-6db3-4a06-a5fd-80a590d4a4e8/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 55c8af5bf0c6baa50ca86d47a1f4086f7ab9284a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:59:01,772 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:59:01,773 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:59:01,783 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:59:01,783 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:59:01,784 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:59:01,785 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:59:01,787 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:59:01,788 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:59:01,789 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:59:01,790 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:59:01,791 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:59:01,791 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:59:01,792 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:59:01,792 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:59:01,793 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:59:01,794 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:59:01,795 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:59:01,796 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:59:01,798 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:59:01,799 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:59:01,800 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:59:01,801 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:59:01,801 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:59:01,803 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:59:01,803 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:59:01,804 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:59:01,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:59:01,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:59:01,805 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:59:01,806 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:59:01,806 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:59:01,807 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:59:01,807 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:59:01,808 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:59:01,809 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:59:01,809 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:59:01,809 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:59:01,810 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:59:01,810 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:59:01,811 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:59:01,811 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_190b0d0b-6db3-4a06-a5fd-80a590d4a4e8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:59:01,822 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:59:01,822 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:59:01,823 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:59:01,823 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:59:01,824 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:59:01,824 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:59:01,824 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:59:01,824 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:59:01,824 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:59:01,825 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:59:01,825 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:59:01,825 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:59:01,825 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:59:01,825 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:59:01,826 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:59:01,826 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:59:01,826 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:59:01,826 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:59:01,826 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:59:01,826 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:59:01,827 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:59:01,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:59:01,827 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:59:01,827 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:59:01,827 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:59:01,828 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:59:01,828 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:59:01,828 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:59:01,829 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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/working_dir_190b0d0b-6db3-4a06-a5fd-80a590d4a4e8/bin/uautomizer 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 -> Automizer 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 -> 55c8af5bf0c6baa50ca86d47a1f4086f7ab9284a [2019-10-22 08:59:01,853 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:59:01,864 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:59:01,867 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:59:01,868 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:59:01,868 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:59:01,869 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_190b0d0b-6db3-4a06-a5fd-80a590d4a4e8/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_clnt_2.cil-1.c [2019-10-22 08:59:01,921 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_190b0d0b-6db3-4a06-a5fd-80a590d4a4e8/bin/uautomizer/data/2f383f028/97d9f9b6b3d04cfab31706b49ba02e47/FLAG812322e83 [2019-10-22 08:59:02,354 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:59:02,357 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_190b0d0b-6db3-4a06-a5fd-80a590d4a4e8/sv-benchmarks/c/ssh-simplified/s3_clnt_2.cil-1.c [2019-10-22 08:59:02,370 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_190b0d0b-6db3-4a06-a5fd-80a590d4a4e8/bin/uautomizer/data/2f383f028/97d9f9b6b3d04cfab31706b49ba02e47/FLAG812322e83 [2019-10-22 08:59:02,675 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_190b0d0b-6db3-4a06-a5fd-80a590d4a4e8/bin/uautomizer/data/2f383f028/97d9f9b6b3d04cfab31706b49ba02e47 [2019-10-22 08:59:02,678 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:59:02,679 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:59:02,680 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:02,680 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:59:02,683 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:59:02,684 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:02" (1/1) ... [2019-10-22 08:59:02,687 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c482975 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:02, skipping insertion in model container [2019-10-22 08:59:02,687 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:59:02" (1/1) ... [2019-10-22 08:59:02,694 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:59:02,728 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:59:03,040 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:03,044 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:59:03,096 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:59:03,110 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:59:03,111 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:03 WrapperNode [2019-10-22 08:59:03,111 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:59:03,112 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:03,112 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:59:03,112 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:59:03,120 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:03" (1/1) ... [2019-10-22 08:59:03,128 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:03" (1/1) ... [2019-10-22 08:59:03,166 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:59:03,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:59:03,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:59:03,168 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:59:03,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:03" (1/1) ... [2019-10-22 08:59:03,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:03" (1/1) ... [2019-10-22 08:59:03,177 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:03" (1/1) ... [2019-10-22 08:59:03,178 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:03" (1/1) ... [2019-10-22 08:59:03,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:03" (1/1) ... [2019-10-22 08:59:03,190 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:03" (1/1) ... [2019-10-22 08:59:03,193 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:03" (1/1) ... [2019-10-22 08:59:03,204 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:59:03,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:59:03,205 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:59:03,205 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:59:03,206 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_190b0d0b-6db3-4a06-a5fd-80a590d4a4e8/bin/uautomizer/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-10-22 08:59:03,260 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:59:03,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:59:03,365 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:59:03,846 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-22 08:59:03,846 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-22 08:59:03,850 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:59:03,850 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 08:59:03,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:03 BoogieIcfgContainer [2019-10-22 08:59:03,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:59:03,852 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:59:03,852 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:59:03,864 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:59:03,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:59:02" (1/3) ... [2019-10-22 08:59:03,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@705834f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:59:03, skipping insertion in model container [2019-10-22 08:59:03,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:59:03" (2/3) ... [2019-10-22 08:59:03,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@705834f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:59:03, skipping insertion in model container [2019-10-22 08:59:03,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:03" (3/3) ... [2019-10-22 08:59:03,867 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_2.cil-1.c [2019-10-22 08:59:03,877 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:59:03,884 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 08:59:03,895 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 08:59:03,919 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:59:03,920 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:59:03,920 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:59:03,920 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:59:03,920 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:59:03,920 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:59:03,921 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:59:03,921 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:59:03,938 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2019-10-22 08:59:03,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 08:59:03,945 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:03,946 INFO L380 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] [2019-10-22 08:59:03,948 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:03,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:03,954 INFO L82 PathProgramCache]: Analyzing trace with hash -1449576961, now seen corresponding path program 1 times [2019-10-22 08:59:03,962 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:03,962 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602756608] [2019-10-22 08:59:03,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:03,963 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:03,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:04,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:04,142 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602756608] [2019-10-22 08:59:04,142 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:04,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:59:04,143 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945572184] [2019-10-22 08:59:04,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:04,147 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:04,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:04,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:04,163 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 3 states. [2019-10-22 08:59:04,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:04,332 INFO L93 Difference]: Finished difference Result 251 states and 426 transitions. [2019-10-22 08:59:04,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:04,334 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-22 08:59:04,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:04,343 INFO L225 Difference]: With dead ends: 251 [2019-10-22 08:59:04,343 INFO L226 Difference]: Without dead ends: 114 [2019-10-22 08:59:04,346 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:04,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-22 08:59:04,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-10-22 08:59:04,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-10-22 08:59:04,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2019-10-22 08:59:04,388 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 171 transitions. Word has length 23 [2019-10-22 08:59:04,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:04,389 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 171 transitions. [2019-10-22 08:59:04,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:04,389 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 171 transitions. [2019-10-22 08:59:04,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 08:59:04,390 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:04,390 INFO L380 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] [2019-10-22 08:59:04,390 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:04,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:04,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1395170557, now seen corresponding path program 1 times [2019-10-22 08:59:04,391 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:04,391 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379421258] [2019-10-22 08:59:04,391 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:04,392 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:04,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:04,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:04,480 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:59:04,480 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379421258] [2019-10-22 08:59:04,481 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:04,481 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:04,481 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929044322] [2019-10-22 08:59:04,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:04,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:04,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:04,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:04,483 INFO L87 Difference]: Start difference. First operand 114 states and 171 transitions. Second operand 3 states. [2019-10-22 08:59:04,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:04,670 INFO L93 Difference]: Finished difference Result 238 states and 361 transitions. [2019-10-22 08:59:04,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:04,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-22 08:59:04,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:04,672 INFO L225 Difference]: With dead ends: 238 [2019-10-22 08:59:04,672 INFO L226 Difference]: Without dead ends: 133 [2019-10-22 08:59:04,673 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:04,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-22 08:59:04,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 129. [2019-10-22 08:59:04,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-10-22 08:59:04,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2019-10-22 08:59:04,688 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 191 transitions. Word has length 36 [2019-10-22 08:59:04,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:04,690 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 191 transitions. [2019-10-22 08:59:04,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:04,690 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 191 transitions. [2019-10-22 08:59:04,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-22 08:59:04,691 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:04,691 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-22 08:59:04,692 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:04,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:04,692 INFO L82 PathProgramCache]: Analyzing trace with hash -134115002, now seen corresponding path program 1 times [2019-10-22 08:59:04,692 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:04,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59900724] [2019-10-22 08:59:04,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:04,693 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:04,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:04,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:04,810 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-22 08:59:04,810 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59900724] [2019-10-22 08:59:04,811 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:04,811 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:04,811 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375229631] [2019-10-22 08:59:04,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:04,812 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:04,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:04,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:04,812 INFO L87 Difference]: Start difference. First operand 129 states and 191 transitions. Second operand 3 states. [2019-10-22 08:59:04,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:04,947 INFO L93 Difference]: Finished difference Result 270 states and 405 transitions. [2019-10-22 08:59:04,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:04,948 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-22 08:59:04,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:04,949 INFO L225 Difference]: With dead ends: 270 [2019-10-22 08:59:04,950 INFO L226 Difference]: Without dead ends: 150 [2019-10-22 08:59:04,950 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:04,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-10-22 08:59:04,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2019-10-22 08:59:04,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-10-22 08:59:04,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions. [2019-10-22 08:59:04,970 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 50 [2019-10-22 08:59:04,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:04,971 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 213 transitions. [2019-10-22 08:59:04,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:04,971 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions. [2019-10-22 08:59:04,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 08:59:04,972 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:04,972 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:04,973 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:04,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:04,973 INFO L82 PathProgramCache]: Analyzing trace with hash -121422705, now seen corresponding path program 1 times [2019-10-22 08:59:04,973 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:04,973 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406553183] [2019-10-22 08:59:04,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:04,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:04,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:05,083 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-22 08:59:05,087 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406553183] [2019-10-22 08:59:05,087 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:05,088 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:05,088 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080049783] [2019-10-22 08:59:05,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:05,091 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:05,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:05,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:05,092 INFO L87 Difference]: Start difference. First operand 146 states and 213 transitions. Second operand 3 states. [2019-10-22 08:59:05,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:05,282 INFO L93 Difference]: Finished difference Result 334 states and 502 transitions. [2019-10-22 08:59:05,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:05,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-10-22 08:59:05,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:05,284 INFO L225 Difference]: With dead ends: 334 [2019-10-22 08:59:05,284 INFO L226 Difference]: Without dead ends: 196 [2019-10-22 08:59:05,285 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:05,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-10-22 08:59:05,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 187. [2019-10-22 08:59:05,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-10-22 08:59:05,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 263 transitions. [2019-10-22 08:59:05,307 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 263 transitions. Word has length 67 [2019-10-22 08:59:05,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:05,308 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 263 transitions. [2019-10-22 08:59:05,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:05,308 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 263 transitions. [2019-10-22 08:59:05,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 08:59:05,309 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:05,309 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:05,310 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:05,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:05,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1926861039, now seen corresponding path program 1 times [2019-10-22 08:59:05,310 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:05,311 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030985936] [2019-10-22 08:59:05,311 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,311 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:05,377 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-22 08:59:05,378 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030985936] [2019-10-22 08:59:05,378 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:05,378 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:05,379 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170754949] [2019-10-22 08:59:05,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:05,379 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:05,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:05,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:05,380 INFO L87 Difference]: Start difference. First operand 187 states and 263 transitions. Second operand 3 states. [2019-10-22 08:59:05,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:05,505 INFO L93 Difference]: Finished difference Result 389 states and 554 transitions. [2019-10-22 08:59:05,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:05,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-10-22 08:59:05,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:05,507 INFO L225 Difference]: With dead ends: 389 [2019-10-22 08:59:05,507 INFO L226 Difference]: Without dead ends: 211 [2019-10-22 08:59:05,508 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:05,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-10-22 08:59:05,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2019-10-22 08:59:05,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-10-22 08:59:05,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions. [2019-10-22 08:59:05,519 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 67 [2019-10-22 08:59:05,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:05,519 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 287 transitions. [2019-10-22 08:59:05,519 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:05,519 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions. [2019-10-22 08:59:05,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 08:59:05,521 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:05,521 INFO L380 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:05,522 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:05,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:05,522 INFO L82 PathProgramCache]: Analyzing trace with hash 398996882, now seen corresponding path program 1 times [2019-10-22 08:59:05,522 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:05,522 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045781172] [2019-10-22 08:59:05,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,523 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,523 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:05,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:05,592 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-22 08:59:05,592 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045781172] [2019-10-22 08:59:05,593 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:05,593 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:05,593 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403384750] [2019-10-22 08:59:05,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:05,593 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:05,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:05,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:05,594 INFO L87 Difference]: Start difference. First operand 206 states and 287 transitions. Second operand 3 states. [2019-10-22 08:59:05,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:05,719 INFO L93 Difference]: Finished difference Result 427 states and 603 transitions. [2019-10-22 08:59:05,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:05,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-10-22 08:59:05,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:05,721 INFO L225 Difference]: With dead ends: 427 [2019-10-22 08:59:05,724 INFO L226 Difference]: Without dead ends: 230 [2019-10-22 08:59:05,725 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:05,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-10-22 08:59:05,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-10-22 08:59:05,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-10-22 08:59:05,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 313 transitions. [2019-10-22 08:59:05,733 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 313 transitions. Word has length 84 [2019-10-22 08:59:05,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:05,733 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 313 transitions. [2019-10-22 08:59:05,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:05,734 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 313 transitions. [2019-10-22 08:59:05,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-22 08:59:05,735 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:05,735 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:05,735 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:05,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:05,736 INFO L82 PathProgramCache]: Analyzing trace with hash 90409290, now seen corresponding path program 1 times [2019-10-22 08:59:05,736 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:05,736 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929950038] [2019-10-22 08:59:05,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,736 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:05,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:59:05,781 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-22 08:59:05,782 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929950038] [2019-10-22 08:59:05,782 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:59:05,782 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:59:05,782 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74943863] [2019-10-22 08:59:05,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:59:05,783 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:59:05,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:59:05,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:05,784 INFO L87 Difference]: Start difference. First operand 227 states and 313 transitions. Second operand 3 states. [2019-10-22 08:59:05,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:59:05,817 INFO L93 Difference]: Finished difference Result 661 states and 912 transitions. [2019-10-22 08:59:05,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:59:05,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-10-22 08:59:05,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:59:05,819 INFO L225 Difference]: With dead ends: 661 [2019-10-22 08:59:05,819 INFO L226 Difference]: Without dead ends: 443 [2019-10-22 08:59:05,820 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:59:05,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-10-22 08:59:05,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2019-10-22 08:59:05,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-10-22 08:59:05,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 609 transitions. [2019-10-22 08:59:05,833 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 609 transitions. Word has length 104 [2019-10-22 08:59:05,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:59:05,833 INFO L462 AbstractCegarLoop]: Abstraction has 443 states and 609 transitions. [2019-10-22 08:59:05,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:59:05,833 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 609 transitions. [2019-10-22 08:59:05,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-22 08:59:05,835 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:59:05,835 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:59:05,835 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:59:05,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:59:05,835 INFO L82 PathProgramCache]: Analyzing trace with hash 935055156, now seen corresponding path program 1 times [2019-10-22 08:59:05,835 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:59:05,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328676949] [2019-10-22 08:59:05,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:59:05,836 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:59:05,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:05,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:59:05,923 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:59:05,923 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 08:59:05,973 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:59:05 BoogieIcfgContainer [2019-10-22 08:59:05,974 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:59:05,974 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:59:05,974 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:59:05,974 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:59:05,975 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:59:03" (3/4) ... [2019-10-22 08:59:05,976 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 08:59:06,102 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_190b0d0b-6db3-4a06-a5fd-80a590d4a4e8/bin/uautomizer/witness.graphml [2019-10-22 08:59:06,105 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:59:06,107 INFO L168 Benchmark]: Toolchain (without parser) took 3428.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 944.7 MB in the beginning and 1.0 GB in the end (delta: -89.6 MB). Peak memory consumption was 47.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:06,108 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:06,110 INFO L168 Benchmark]: CACSL2BoogieTranslator took 431.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:06,111 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:59:06,111 INFO L168 Benchmark]: Boogie Preprocessor took 36.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:06,111 INFO L168 Benchmark]: RCFGBuilder took 646.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:06,111 INFO L168 Benchmark]: TraceAbstraction took 2121.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:06,112 INFO L168 Benchmark]: Witness Printer took 131.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:59:06,113 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 431.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 939.4 MB in the beginning and 1.1 GB in the end (delta: -187.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.43 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 646.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2121.65 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 24.1 MB). Peak memory consumption was 24.1 MB. Max. memory is 11.5 GB. * Witness Printer took 131.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 12.2 MB). Peak memory consumption was 12.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 549]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L554] int s ; [L558] s = 12292 [L12] int s__info_callback = __VERIFIER_nondet_int() ; [L13] int s__in_handshake = __VERIFIER_nondet_int() ; [L14] int s__state ; [L15] int s__new_session ; [L16] int s__server ; [L17] int s__version = __VERIFIER_nondet_int() ; [L18] int s__type ; [L19] int s__init_num ; [L20] int s__bbio = __VERIFIER_nondet_int() ; [L21] int s__wbio = __VERIFIER_nondet_int() ; [L22] int s__hit = __VERIFIER_nondet_int() ; [L23] int s__rwstate ; [L24] int s__init_buf___0 = 1; [L25] int s__debug = __VERIFIER_nondet_int() ; [L26] int s__shutdown ; [L27] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L28] int s__ctx__stats__sess_connect_renegotiate = __VERIFIER_nondet_int() ; [L29] int s__ctx__stats__sess_connect = __VERIFIER_nondet_int() ; [L30] int s__ctx__stats__sess_hit = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_connect_good = __VERIFIER_nondet_int() ; [L32] int s__s3__change_cipher_spec ; [L33] int s__s3__flags ; [L34] int s__s3__delay_buf_pop_ret ; [L35] int s__s3__tmp__cert_req = __VERIFIER_nondet_int() ; [L36] int s__s3__tmp__new_compression = __VERIFIER_nondet_int() ; [L37] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L39] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() ; [L40] int s__s3__tmp__next_state___0 ; [L41] int s__s3__tmp__new_compression__id = __VERIFIER_nondet_int() ; [L42] int s__session__cipher ; [L43] int s__session__compress_meth ; [L44] int buf ; [L45] unsigned long tmp ; [L46] unsigned long l ; [L47] int num1 ; [L48] int cb ; [L49] int ret ; [L50] int new_state ; [L51] int state ; [L52] int skip ; [L53] int tmp___0 ; [L54] int tmp___1 = __VERIFIER_nondet_int() ; [L55] int tmp___2 = __VERIFIER_nondet_int() ; [L56] int tmp___3 = __VERIFIER_nondet_int() ; [L57] int tmp___4 = __VERIFIER_nondet_int() ; [L58] int tmp___5 = __VERIFIER_nondet_int() ; [L59] int tmp___6 = __VERIFIER_nondet_int() ; [L60] int tmp___7 = __VERIFIER_nondet_int() ; [L61] int tmp___8 = __VERIFIER_nondet_int() ; [L62] int tmp___9 = __VERIFIER_nondet_int() ; [L63] int blastFlag ; [L64] int __cil_tmp55 ; [L65] unsigned long __cil_tmp56 ; [L66] long __cil_tmp57 ; [L67] long __cil_tmp58 ; [L68] long __cil_tmp59 ; [L69] long __cil_tmp60 ; [L70] long __cil_tmp61 ; [L71] long __cil_tmp62 ; [L72] long __cil_tmp63 ; [L73] long __cil_tmp64 ; [L74] long __cil_tmp65 ; [L78] s__state = initial_state [L79] blastFlag = 0 [L80] tmp = __VERIFIER_nondet_int() [L81] cb = 0 [L82] ret = -1 [L83] skip = 0 [L84] tmp___0 = 0 [L85] COND TRUE s__info_callback != 0 [L86] cb = s__info_callback [L92] s__in_handshake ++ [L93] COND FALSE !(tmp___1 - 12288) [L99] COND TRUE 1 [L101] state = s__state [L102] COND TRUE s__state == 12292 [L204] s__new_session = 1 [L205] s__state = 4096 [L206] s__ctx__stats__sess_connect_renegotiate ++ [L211] s__server = 0 [L212] COND TRUE cb != 0 [L216] __cil_tmp55 = s__version - 65280 [L217] COND FALSE !(__cil_tmp55 != 768) [L222] s__type = 4096 [L223] COND FALSE !(s__init_buf___0 == 0) [L235] COND FALSE !(! tmp___4) [L239] COND FALSE !(! tmp___5) [L243] s__state = 4368 [L244] s__ctx__stats__sess_connect ++ [L245] s__init_num = 0 [L521] COND FALSE !(! s__s3__tmp__reuse_message) [L538] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND TRUE s__state == 4368 [L249] s__shutdown = 0 [L250] ret = __VERIFIER_nondet_int() [L251] COND TRUE blastFlag == 0 [L252] blastFlag = 1 [L258] COND FALSE !(ret <= 0) [L261] s__state = 4384 [L262] s__init_num = 0 [L263] COND TRUE s__bbio != s__wbio [L521] COND FALSE !(! s__s3__tmp__reuse_message) [L538] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND FALSE !(s__state == 4368) [L120] COND FALSE !(s__state == 4369) [L123] COND TRUE s__state == 4384 [L269] ret = __VERIFIER_nondet_int() [L270] COND TRUE blastFlag == 1 [L271] blastFlag = 2 [L273] COND FALSE !(ret <= 0) [L276] COND FALSE !(\read(s__hit)) [L279] s__state = 4400 [L281] s__init_num = 0 [L521] COND FALSE !(! s__s3__tmp__reuse_message) [L538] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND FALSE !(s__state == 4368) [L120] COND FALSE !(s__state == 4369) [L123] COND FALSE !(s__state == 4384) [L126] COND FALSE !(s__state == 4385) [L129] COND TRUE s__state == 4400 [L286] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L287] COND FALSE !(__cil_tmp56 - 256UL) [L290] ret = __VERIFIER_nondet_int() [L291] COND TRUE blastFlag == 2 [L292] blastFlag = 3 [L294] COND FALSE !(ret <= 0) [L299] s__state = 4416 [L300] s__init_num = 0 [L521] COND FALSE !(! s__s3__tmp__reuse_message) [L538] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND FALSE !(s__state == 4368) [L120] COND FALSE !(s__state == 4369) [L123] COND FALSE !(s__state == 4384) [L126] COND FALSE !(s__state == 4385) [L129] COND FALSE !(s__state == 4400) [L132] COND FALSE !(s__state == 4401) [L135] COND TRUE s__state == 4416 [L304] ret = __VERIFIER_nondet_int() [L305] COND TRUE blastFlag == 3 [L306] blastFlag = 4 [L308] COND FALSE !(ret <= 0) [L311] s__state = 4432 [L312] s__init_num = 0 [L313] COND FALSE !(! tmp___6) [L521] COND FALSE !(! s__s3__tmp__reuse_message) [L538] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 4096) [L111] COND FALSE !(s__state == 20480) [L114] COND FALSE !(s__state == 4099) [L117] COND FALSE !(s__state == 4368) [L120] COND FALSE !(s__state == 4369) [L123] COND FALSE !(s__state == 4384) [L126] COND FALSE !(s__state == 4385) [L129] COND FALSE !(s__state == 4400) [L132] COND FALSE !(s__state == 4401) [L135] COND FALSE !(s__state == 4416) [L138] COND FALSE !(s__state == 4417) [L141] COND TRUE s__state == 4432 [L320] ret = __VERIFIER_nondet_int() [L321] COND TRUE blastFlag == 4 [L549] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 127 locations, 1 error locations. Result: UNSAFE, OverallTime: 2.0s, OverallIterations: 8, TraceHistogramMax: 6, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1223 SDtfs, 255 SDslu, 651 SDs, 0 SdLazy, 617 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=443occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 25 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 537 NumberOfCodeBlocks, 537 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 424 ConstructedInterpolants, 0 QuantifiedInterpolants, 47530 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 316/316 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...