./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_clnt_1.cil-2.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_f43aff31-9973-465f-838c-e7743d434c4a/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f43aff31-9973-465f-838c-e7743d434c4a/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f43aff31-9973-465f-838c-e7743d434c4a/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f43aff31-9973-465f-838c-e7743d434c4a/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_1.cil-2.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f43aff31-9973-465f-838c-e7743d434c4a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f43aff31-9973-465f-838c-e7743d434c4a/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 993187c97cafd5fe3d3d6eb89b9febe6c67510de ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:54:11,746 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:54:11,748 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:54:11,760 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:54:11,761 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:54:11,761 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:54:11,763 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:54:11,764 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:54:11,765 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:54:11,766 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:54:11,767 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:54:11,768 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:54:11,768 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:54:11,769 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:54:11,770 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:54:11,771 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:54:11,771 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:54:11,772 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:54:11,773 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:54:11,775 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:54:11,776 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:54:11,777 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:54:11,778 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:54:11,778 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:54:11,780 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:54:11,780 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:54:11,781 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:54:11,781 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:54:11,782 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:54:11,783 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:54:11,783 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:54:11,783 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:54:11,784 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:54:11,785 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:54:11,785 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:54:11,786 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:54:11,786 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:54:11,786 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:54:11,787 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:54:11,787 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:54:11,788 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:54:11,789 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f43aff31-9973-465f-838c-e7743d434c4a/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:54:11,800 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:54:11,800 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:54:11,801 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:54:11,801 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:54:11,801 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:54:11,802 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:54:11,802 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:54:11,802 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:54:11,802 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:54:11,802 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:54:11,803 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:54:11,803 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:54:11,803 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:54:11,803 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:54:11,803 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:54:11,803 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:54:11,804 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:54:11,804 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:54:11,804 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:54:11,804 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:54:11,804 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:54:11,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:54:11,805 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:54:11,805 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:54:11,805 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:54:11,805 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:54:11,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:54:11,805 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:54:11,805 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_f43aff31-9973-465f-838c-e7743d434c4a/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 -> 993187c97cafd5fe3d3d6eb89b9febe6c67510de [2019-10-22 08:54:11,838 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:54:11,849 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:54:11,852 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:54:11,854 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:54:11,854 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:54:11,855 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f43aff31-9973-465f-838c-e7743d434c4a/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_clnt_1.cil-2.c [2019-10-22 08:54:11,912 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f43aff31-9973-465f-838c-e7743d434c4a/bin/uautomizer/data/3dd8dcae0/0002922d5809450e9f400345a20f4e7d/FLAG051e85780 [2019-10-22 08:54:12,309 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:54:12,310 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f43aff31-9973-465f-838c-e7743d434c4a/sv-benchmarks/c/ssh-simplified/s3_clnt_1.cil-2.c [2019-10-22 08:54:12,318 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f43aff31-9973-465f-838c-e7743d434c4a/bin/uautomizer/data/3dd8dcae0/0002922d5809450e9f400345a20f4e7d/FLAG051e85780 [2019-10-22 08:54:12,328 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f43aff31-9973-465f-838c-e7743d434c4a/bin/uautomizer/data/3dd8dcae0/0002922d5809450e9f400345a20f4e7d [2019-10-22 08:54:12,330 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:54:12,331 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:54:12,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:12,332 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:54:12,338 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:54:12,339 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3595549a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12, skipping insertion in model container [2019-10-22 08:54:12,342 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,348 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:54:12,390 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:54:12,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:12,626 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:54:12,681 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:12,695 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:54:12,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12 WrapperNode [2019-10-22 08:54:12,695 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:12,696 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:12,696 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:54:12,696 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:54:12,701 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:54:12" (1/1) ... [2019-10-22 08:54:12,708 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:54:12" (1/1) ... [2019-10-22 08:54:12,736 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:12,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:54:12,737 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:54:12,737 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:54:12,746 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,749 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,749 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,754 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,760 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,762 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... [2019-10-22 08:54:12,765 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:54:12,766 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:54:12,766 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:54:12,766 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:54:12,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f43aff31-9973-465f-838c-e7743d434c4a/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:54:12,858 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:54:12,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:54:13,011 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 08:54:13,481 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-10-22 08:54:13,481 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-10-22 08:54:13,482 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:54:13,483 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 08:54:13,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:13 BoogieIcfgContainer [2019-10-22 08:54:13,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:54:13,485 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:54:13,485 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:54:13,496 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:54:13,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:54:12" (1/3) ... [2019-10-22 08:54:13,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b579a1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:54:13, skipping insertion in model container [2019-10-22 08:54:13,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:12" (2/3) ... [2019-10-22 08:54:13,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b579a1f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:54:13, skipping insertion in model container [2019-10-22 08:54:13,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:13" (3/3) ... [2019-10-22 08:54:13,507 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_1.cil-2.c [2019-10-22 08:54:13,520 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:54:13,527 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 08:54:13,546 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 08:54:13,584 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:54:13,585 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:54:13,585 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:54:13,585 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:54:13,585 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:54:13,585 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:54:13,586 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:54:13,586 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:54:13,602 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states. [2019-10-22 08:54:13,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 08:54:13,607 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:13,608 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:54:13,610 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:13,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:13,615 INFO L82 PathProgramCache]: Analyzing trace with hash -1449582913, now seen corresponding path program 1 times [2019-10-22 08:54:13,625 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:13,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904294535] [2019-10-22 08:54:13,626 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,627 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:13,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:13,799 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:54:13,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904294535] [2019-10-22 08:54:13,806 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:13,806 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:54:13,806 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622769913] [2019-10-22 08:54:13,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:13,811 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:13,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:13,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:13,824 INFO L87 Difference]: Start difference. First operand 126 states. Second operand 3 states. [2019-10-22 08:54:14,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:14,045 INFO L93 Difference]: Finished difference Result 249 states and 424 transitions. [2019-10-22 08:54:14,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:14,047 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-10-22 08:54:14,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:14,056 INFO L225 Difference]: With dead ends: 249 [2019-10-22 08:54:14,057 INFO L226 Difference]: Without dead ends: 113 [2019-10-22 08:54:14,060 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:54:14,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2019-10-22 08:54:14,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2019-10-22 08:54:14,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2019-10-22 08:54:14,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 170 transitions. [2019-10-22 08:54:14,097 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 170 transitions. Word has length 23 [2019-10-22 08:54:14,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:14,097 INFO L462 AbstractCegarLoop]: Abstraction has 113 states and 170 transitions. [2019-10-22 08:54:14,097 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:14,098 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 170 transitions. [2019-10-22 08:54:14,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-10-22 08:54:14,099 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:14,099 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:54:14,099 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:14,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:14,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1395164605, now seen corresponding path program 1 times [2019-10-22 08:54:14,100 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:14,100 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579298486] [2019-10-22 08:54:14,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:14,100 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:14,101 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:14,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:14,159 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:54:14,160 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579298486] [2019-10-22 08:54:14,160 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:14,160 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:14,160 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271190089] [2019-10-22 08:54:14,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:14,162 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:14,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:14,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:14,163 INFO L87 Difference]: Start difference. First operand 113 states and 170 transitions. Second operand 3 states. [2019-10-22 08:54:14,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:14,341 INFO L93 Difference]: Finished difference Result 235 states and 357 transitions. [2019-10-22 08:54:14,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:14,343 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-10-22 08:54:14,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:14,344 INFO L225 Difference]: With dead ends: 235 [2019-10-22 08:54:14,344 INFO L226 Difference]: Without dead ends: 131 [2019-10-22 08:54:14,345 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:54:14,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-10-22 08:54:14,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2019-10-22 08:54:14,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-10-22 08:54:14,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 190 transitions. [2019-10-22 08:54:14,356 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 190 transitions. Word has length 36 [2019-10-22 08:54:14,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:14,356 INFO L462 AbstractCegarLoop]: Abstraction has 128 states and 190 transitions. [2019-10-22 08:54:14,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:14,356 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 190 transitions. [2019-10-22 08:54:14,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-22 08:54:14,359 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:14,359 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:54:14,360 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:14,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:14,360 INFO L82 PathProgramCache]: Analyzing trace with hash -462629210, now seen corresponding path program 1 times [2019-10-22 08:54:14,360 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:14,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346412357] [2019-10-22 08:54:14,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:14,361 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:14,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:14,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:14,476 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:54:14,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346412357] [2019-10-22 08:54:14,478 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:14,478 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:14,478 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517990659] [2019-10-22 08:54:14,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:14,480 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:14,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:14,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:14,481 INFO L87 Difference]: Start difference. First operand 128 states and 190 transitions. Second operand 3 states. [2019-10-22 08:54:14,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:14,619 INFO L93 Difference]: Finished difference Result 268 states and 403 transitions. [2019-10-22 08:54:14,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:14,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-22 08:54:14,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:14,621 INFO L225 Difference]: With dead ends: 268 [2019-10-22 08:54:14,621 INFO L226 Difference]: Without dead ends: 149 [2019-10-22 08:54:14,621 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:54:14,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2019-10-22 08:54:14,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 145. [2019-10-22 08:54:14,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-10-22 08:54:14,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 212 transitions. [2019-10-22 08:54:14,640 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 212 transitions. Word has length 50 [2019-10-22 08:54:14,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:14,641 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 212 transitions. [2019-10-22 08:54:14,641 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:14,641 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 212 transitions. [2019-10-22 08:54:14,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 08:54:14,642 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:14,642 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:54:14,642 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:14,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:14,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1168372140, now seen corresponding path program 1 times [2019-10-22 08:54:14,643 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:14,643 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606286912] [2019-10-22 08:54:14,643 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:14,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:14,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:14,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:14,756 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:54:14,756 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606286912] [2019-10-22 08:54:14,757 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:14,757 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:14,757 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599007519] [2019-10-22 08:54:14,758 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:14,758 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:14,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:14,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:14,758 INFO L87 Difference]: Start difference. First operand 145 states and 212 transitions. Second operand 3 states. [2019-10-22 08:54:14,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:14,969 INFO L93 Difference]: Finished difference Result 332 states and 500 transitions. [2019-10-22 08:54:14,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:14,970 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-10-22 08:54:14,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:14,972 INFO L225 Difference]: With dead ends: 332 [2019-10-22 08:54:14,972 INFO L226 Difference]: Without dead ends: 195 [2019-10-22 08:54:14,975 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:54:14,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-10-22 08:54:14,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 186. [2019-10-22 08:54:14,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-10-22 08:54:14,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 262 transitions. [2019-10-22 08:54:14,992 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 262 transitions. Word has length 67 [2019-10-22 08:54:14,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:14,996 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 262 transitions. [2019-10-22 08:54:14,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:14,996 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 262 transitions. [2019-10-22 08:54:14,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 08:54:14,997 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:14,998 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:54:14,998 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:14,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:14,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1321156822, now seen corresponding path program 1 times [2019-10-22 08:54:14,999 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:14,999 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68706095] [2019-10-22 08:54:14,999 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:14,999 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:14,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:15,067 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:54:15,068 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68706095] [2019-10-22 08:54:15,068 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:15,068 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:15,069 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347276486] [2019-10-22 08:54:15,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:15,069 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:15,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:15,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:15,070 INFO L87 Difference]: Start difference. First operand 186 states and 262 transitions. Second operand 3 states. [2019-10-22 08:54:15,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:15,202 INFO L93 Difference]: Finished difference Result 386 states and 551 transitions. [2019-10-22 08:54:15,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:15,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-10-22 08:54:15,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:15,205 INFO L225 Difference]: With dead ends: 386 [2019-10-22 08:54:15,205 INFO L226 Difference]: Without dead ends: 209 [2019-10-22 08:54:15,206 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:54:15,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2019-10-22 08:54:15,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 205. [2019-10-22 08:54:15,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-22 08:54:15,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 286 transitions. [2019-10-22 08:54:15,228 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 286 transitions. Word has length 67 [2019-10-22 08:54:15,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:15,229 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 286 transitions. [2019-10-22 08:54:15,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:15,229 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 286 transitions. [2019-10-22 08:54:15,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-22 08:54:15,231 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:15,231 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] [2019-10-22 08:54:15,231 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:15,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:15,231 INFO L82 PathProgramCache]: Analyzing trace with hash 2047596972, now seen corresponding path program 1 times [2019-10-22 08:54:15,232 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:15,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376942110] [2019-10-22 08:54:15,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:15,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:15,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:15,309 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:54:15,310 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376942110] [2019-10-22 08:54:15,310 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:15,310 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:15,310 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300325781] [2019-10-22 08:54:15,310 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:15,311 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:15,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:15,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:15,311 INFO L87 Difference]: Start difference. First operand 205 states and 286 transitions. Second operand 3 states. [2019-10-22 08:54:15,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:15,438 INFO L93 Difference]: Finished difference Result 425 states and 601 transitions. [2019-10-22 08:54:15,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:15,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-10-22 08:54:15,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:15,440 INFO L225 Difference]: With dead ends: 425 [2019-10-22 08:54:15,440 INFO L226 Difference]: Without dead ends: 229 [2019-10-22 08:54:15,441 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:54:15,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2019-10-22 08:54:15,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2019-10-22 08:54:15,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2019-10-22 08:54:15,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 312 transitions. [2019-10-22 08:54:15,449 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 312 transitions. Word has length 83 [2019-10-22 08:54:15,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:15,449 INFO L462 AbstractCegarLoop]: Abstraction has 226 states and 312 transitions. [2019-10-22 08:54:15,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:15,450 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 312 transitions. [2019-10-22 08:54:15,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-22 08:54:15,451 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:15,451 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] [2019-10-22 08:54:15,451 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:15,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:15,451 INFO L82 PathProgramCache]: Analyzing trace with hash -339026460, now seen corresponding path program 1 times [2019-10-22 08:54:15,452 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:15,452 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716843598] [2019-10-22 08:54:15,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:15,452 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:15,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:15,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:15,508 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:54:15,508 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716843598] [2019-10-22 08:54:15,508 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:15,508 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:15,508 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810743119] [2019-10-22 08:54:15,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:15,509 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:15,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:15,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:15,509 INFO L87 Difference]: Start difference. First operand 226 states and 312 transitions. Second operand 3 states. [2019-10-22 08:54:15,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:15,547 INFO L93 Difference]: Finished difference Result 658 states and 909 transitions. [2019-10-22 08:54:15,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:15,548 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 103 [2019-10-22 08:54:15,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:15,550 INFO L225 Difference]: With dead ends: 658 [2019-10-22 08:54:15,550 INFO L226 Difference]: Without dead ends: 441 [2019-10-22 08:54:15,551 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:54:15,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2019-10-22 08:54:15,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 441. [2019-10-22 08:54:15,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2019-10-22 08:54:15,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 607 transitions. [2019-10-22 08:54:15,565 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 607 transitions. Word has length 103 [2019-10-22 08:54:15,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:15,565 INFO L462 AbstractCegarLoop]: Abstraction has 441 states and 607 transitions. [2019-10-22 08:54:15,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:15,565 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 607 transitions. [2019-10-22 08:54:15,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-22 08:54:15,567 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:15,567 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] [2019-10-22 08:54:15,567 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:15,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:15,568 INFO L82 PathProgramCache]: Analyzing trace with hash 348265998, now seen corresponding path program 1 times [2019-10-22 08:54:15,568 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:15,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981047071] [2019-10-22 08:54:15,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:15,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:15,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:15,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:15,672 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:15,677 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 08:54:15,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:54:15 BoogieIcfgContainer [2019-10-22 08:54:15,758 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:54:15,758 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:54:15,759 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:54:15,759 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:54:15,759 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:13" (3/4) ... [2019-10-22 08:54:15,762 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 08:54:15,882 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f43aff31-9973-465f-838c-e7743d434c4a/bin/uautomizer/witness.graphml [2019-10-22 08:54:15,882 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:54:15,884 INFO L168 Benchmark]: Toolchain (without parser) took 3551.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 943.4 MB in the beginning and 1.0 GB in the end (delta: -88.0 MB). Peak memory consumption was 51.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:15,884 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:15,884 INFO L168 Benchmark]: CACSL2BoogieTranslator took 362.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -185.2 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:15,885 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.89 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:54:15,885 INFO L168 Benchmark]: Boogie Preprocessor took 28.81 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:54:15,888 INFO L168 Benchmark]: RCFGBuilder took 718.44 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: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:15,888 INFO L168 Benchmark]: TraceAbstraction took 2273.34 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:15,889 INFO L168 Benchmark]: Witness Printer took 123.46 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: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:15,890 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 362.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 139.5 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -185.2 MB). Peak memory consumption was 23.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.89 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 28.81 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 718.44 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: 51.9 MB). Peak memory consumption was 51.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2273.34 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: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * Witness Printer took 123.46 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: 17.5 MB). Peak memory consumption was 17.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 544]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L549] int s ; [L553] 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] 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 ; [L77] s__state = initial_state [L78] blastFlag = 0 [L79] tmp = __VERIFIER_nondet_int() [L80] cb = 0 [L81] ret = -1 [L82] skip = 0 [L83] tmp___0 = 0 [L84] COND TRUE s__info_callback != 0 [L85] cb = s__info_callback [L91] s__in_handshake ++ [L92] COND FALSE !(tmp___1 - 12288) [L98] COND TRUE 1 [L100] state = s__state [L101] COND TRUE s__state == 12292 [L203] s__new_session = 1 [L204] s__state = 4096 [L205] s__ctx__stats__sess_connect_renegotiate ++ [L210] s__server = 0 [L211] COND TRUE cb != 0 [L215] __cil_tmp55 = s__version - 65280 [L216] COND FALSE !(__cil_tmp55 != 768) [L221] s__type = 4096 [L222] COND FALSE !(s__init_buf___0 == 0) [L234] COND FALSE !(! tmp___4) [L238] COND FALSE !(! tmp___5) [L242] s__state = 4368 [L243] s__ctx__stats__sess_connect ++ [L244] s__init_num = 0 [L516] COND FALSE !(! s__s3__tmp__reuse_message) [L533] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 4096) [L110] COND FALSE !(s__state == 20480) [L113] COND FALSE !(s__state == 4099) [L116] COND TRUE s__state == 4368 [L248] s__shutdown = 0 [L249] ret = __VERIFIER_nondet_int() [L250] COND TRUE blastFlag == 0 [L251] blastFlag = 1 [L253] COND FALSE !(ret <= 0) [L256] s__state = 4384 [L257] s__init_num = 0 [L258] COND TRUE s__bbio != s__wbio [L516] COND FALSE !(! s__s3__tmp__reuse_message) [L533] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 4096) [L110] COND FALSE !(s__state == 20480) [L113] COND FALSE !(s__state == 4099) [L116] COND FALSE !(s__state == 4368) [L119] COND FALSE !(s__state == 4369) [L122] COND TRUE s__state == 4384 [L264] ret = __VERIFIER_nondet_int() [L265] COND TRUE blastFlag == 1 [L266] blastFlag = 2 [L268] COND FALSE !(ret <= 0) [L271] COND FALSE !(\read(s__hit)) [L274] s__state = 4400 [L276] s__init_num = 0 [L516] COND FALSE !(! s__s3__tmp__reuse_message) [L533] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 4096) [L110] COND FALSE !(s__state == 20480) [L113] COND FALSE !(s__state == 4099) [L116] COND FALSE !(s__state == 4368) [L119] COND FALSE !(s__state == 4369) [L122] COND FALSE !(s__state == 4384) [L125] COND FALSE !(s__state == 4385) [L128] COND TRUE s__state == 4400 [L280] COND FALSE !(s__s3__tmp__new_cipher__algorithms - 256) [L283] ret = __VERIFIER_nondet_int() [L284] COND TRUE blastFlag == 2 [L285] blastFlag = 3 [L287] COND FALSE !(ret <= 0) [L291] s__state = 4416 [L292] s__init_num = 0 [L516] COND FALSE !(! s__s3__tmp__reuse_message) [L533] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 4096) [L110] COND FALSE !(s__state == 20480) [L113] COND FALSE !(s__state == 4099) [L116] COND FALSE !(s__state == 4368) [L119] COND FALSE !(s__state == 4369) [L122] COND FALSE !(s__state == 4384) [L125] COND FALSE !(s__state == 4385) [L128] COND FALSE !(s__state == 4400) [L131] COND FALSE !(s__state == 4401) [L134] COND TRUE s__state == 4416 [L296] ret = __VERIFIER_nondet_int() [L297] COND TRUE blastFlag == 3 [L298] blastFlag = 4 [L300] COND FALSE !(ret <= 0) [L303] s__state = 4432 [L304] s__init_num = 0 [L305] COND FALSE !(! tmp___6) [L516] COND FALSE !(! s__s3__tmp__reuse_message) [L533] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 4096) [L110] COND FALSE !(s__state == 20480) [L113] COND FALSE !(s__state == 4099) [L116] COND FALSE !(s__state == 4368) [L119] COND FALSE !(s__state == 4369) [L122] COND FALSE !(s__state == 4384) [L125] COND FALSE !(s__state == 4385) [L128] COND FALSE !(s__state == 4400) [L131] COND FALSE !(s__state == 4401) [L134] COND FALSE !(s__state == 4416) [L137] COND FALSE !(s__state == 4417) [L140] COND TRUE s__state == 4432 [L312] ret = __VERIFIER_nondet_int() [L313] COND TRUE blastFlag == 4 [L544] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 126 locations, 1 error locations. Result: UNSAFE, OverallTime: 2.1s, OverallIterations: 8, TraceHistogramMax: 6, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1216 SDtfs, 252 SDslu, 644 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=441occurred 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, 23 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 534 NumberOfCodeBlocks, 534 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 422 ConstructedInterpolants, 0 QuantifiedInterpolants, 46848 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...