./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_1.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_8a8182f5-ef5e-4fd8-8f06-50f5c2ca4944/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8a8182f5-ef5e-4fd8-8f06-50f5c2ca4944/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8a8182f5-ef5e-4fd8-8f06-50f5c2ca4944/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8a8182f5-ef5e-4fd8-8f06-50f5c2ca4944/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_1.cil-1.c -s /tmp/vcloud-vcloud-master/worker/working_dir_8a8182f5-ef5e-4fd8-8f06-50f5c2ca4944/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8a8182f5-ef5e-4fd8-8f06-50f5c2ca4944/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 0944271f92e776b1323f4e63320c545c96d5c7d9 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 09:02:41,655 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:02:41,657 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:02:41,665 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:02:41,665 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:02:41,666 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:02:41,667 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:02:41,668 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:02:41,670 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:02:41,670 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:02:41,671 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:02:41,672 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:02:41,672 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:02:41,673 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:02:41,673 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:02:41,674 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:02:41,675 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:02:41,676 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:02:41,677 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:02:41,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:02:41,680 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:02:41,681 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:02:41,682 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:02:41,682 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:02:41,685 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:02:41,685 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:02:41,685 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:02:41,686 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:02:41,686 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:02:41,687 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:02:41,687 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:02:41,688 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:02:41,689 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:02:41,689 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:02:41,690 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:02:41,690 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:02:41,691 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:02:41,691 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:02:41,691 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:02:41,692 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:02:41,693 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:02:41,694 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8a8182f5-ef5e-4fd8-8f06-50f5c2ca4944/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 09:02:41,705 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:02:41,705 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:02:41,706 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:02:41,706 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:02:41,707 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:02:41,707 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:02:41,707 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:02:41,707 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:02:41,707 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:02:41,707 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:02:41,707 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 09:02:41,708 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 09:02:41,708 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 09:02:41,708 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:02:41,708 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:02:41,708 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:02:41,709 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 09:02:41,709 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:02:41,709 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:02:41,709 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 09:02:41,709 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 09:02:41,709 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:02:41,710 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:02:41,710 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 09:02:41,710 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 09:02:41,710 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:02:41,710 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 09:02:41,710 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 09:02:41,710 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_8a8182f5-ef5e-4fd8-8f06-50f5c2ca4944/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 -> 0944271f92e776b1323f4e63320c545c96d5c7d9 [2019-10-22 09:02:41,733 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:02:41,742 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:02:41,745 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:02:41,746 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:02:41,747 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:02:41,747 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8a8182f5-ef5e-4fd8-8f06-50f5c2ca4944/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_1.cil-1.c [2019-10-22 09:02:41,799 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8a8182f5-ef5e-4fd8-8f06-50f5c2ca4944/bin/uautomizer/data/5f2a8a0a1/dcebc6b781e545908161d885d921797b/FLAGa3f5df15f [2019-10-22 09:02:42,173 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:02:42,174 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8a8182f5-ef5e-4fd8-8f06-50f5c2ca4944/sv-benchmarks/c/ssh-simplified/s3_srvr_1.cil-1.c [2019-10-22 09:02:42,186 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8a8182f5-ef5e-4fd8-8f06-50f5c2ca4944/bin/uautomizer/data/5f2a8a0a1/dcebc6b781e545908161d885d921797b/FLAGa3f5df15f [2019-10-22 09:02:42,199 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8a8182f5-ef5e-4fd8-8f06-50f5c2ca4944/bin/uautomizer/data/5f2a8a0a1/dcebc6b781e545908161d885d921797b [2019-10-22 09:02:42,202 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:02:42,203 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:02:42,205 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:42,205 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:02:42,210 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:02:42,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:42" (1/1) ... [2019-10-22 09:02:42,213 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1044e2c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:42, skipping insertion in model container [2019-10-22 09:02:42,213 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:02:42" (1/1) ... [2019-10-22 09:02:42,220 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:02:42,260 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:02:42,513 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:42,516 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:02:42,569 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:02:42,583 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:02:42,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:42 WrapperNode [2019-10-22 09:02:42,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:02:42,586 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:42,590 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:02:42,590 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:02:42,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:42" (1/1) ... [2019-10-22 09:02:42,605 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:42" (1/1) ... [2019-10-22 09:02:42,637 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:02:42,637 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:02:42,637 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:02:42,637 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:02:42,647 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:42" (1/1) ... [2019-10-22 09:02:42,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:42" (1/1) ... [2019-10-22 09:02:42,650 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:42" (1/1) ... [2019-10-22 09:02:42,650 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:42" (1/1) ... [2019-10-22 09:02:42,667 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:42" (1/1) ... [2019-10-22 09:02:42,674 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:42" (1/1) ... [2019-10-22 09:02:42,687 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:42" (1/1) ... [2019-10-22 09:02:42,696 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:02:42,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:02:42,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:02:42,696 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:02:42,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8a8182f5-ef5e-4fd8-8f06-50f5c2ca4944/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 09:02:42,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:02:42,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:02:42,892 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-22 09:02:43,477 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-10-22 09:02:43,477 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-10-22 09:02:43,479 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:02:43,479 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-22 09:02:43,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:43 BoogieIcfgContainer [2019-10-22 09:02:43,480 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:02:43,481 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 09:02:43,481 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 09:02:43,484 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 09:02:43,484 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:02:42" (1/3) ... [2019-10-22 09:02:43,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac511cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:02:43, skipping insertion in model container [2019-10-22 09:02:43,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:02:42" (2/3) ... [2019-10-22 09:02:43,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac511cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:02:43, skipping insertion in model container [2019-10-22 09:02:43,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:43" (3/3) ... [2019-10-22 09:02:43,487 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_1.cil-1.c [2019-10-22 09:02:43,496 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 09:02:43,503 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 09:02:43,512 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 09:02:43,536 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 09:02:43,536 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 09:02:43,536 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 09:02:43,536 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:02:43,537 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:02:43,537 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 09:02:43,537 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:02:43,537 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 09:02:43,552 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states. [2019-10-22 09:02:43,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-22 09:02:43,560 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:43,561 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:43,563 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:43,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:43,568 INFO L82 PathProgramCache]: Analyzing trace with hash 1455126500, now seen corresponding path program 1 times [2019-10-22 09:02:43,575 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:43,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1701168272] [2019-10-22 09:02:43,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:43,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:43,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:43,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:43,772 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 09:02:43,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1701168272] [2019-10-22 09:02:43,774 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:43,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:43,774 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30460505] [2019-10-22 09:02:43,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:43,779 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:43,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:43,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:43,793 INFO L87 Difference]: Start difference. First operand 142 states. Second operand 3 states. [2019-10-22 09:02:44,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:44,063 INFO L93 Difference]: Finished difference Result 332 states and 569 transitions. [2019-10-22 09:02:44,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:44,065 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-10-22 09:02:44,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:44,076 INFO L225 Difference]: With dead ends: 332 [2019-10-22 09:02:44,077 INFO L226 Difference]: Without dead ends: 177 [2019-10-22 09:02:44,079 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 09:02:44,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2019-10-22 09:02:44,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 171. [2019-10-22 09:02:44,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-10-22 09:02:44,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 277 transitions. [2019-10-22 09:02:44,125 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 277 transitions. Word has length 44 [2019-10-22 09:02:44,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:44,125 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 277 transitions. [2019-10-22 09:02:44,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:44,125 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 277 transitions. [2019-10-22 09:02:44,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-22 09:02:44,127 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:44,127 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, 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 09:02:44,127 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:44,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:44,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1939296701, now seen corresponding path program 1 times [2019-10-22 09:02:44,128 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:44,128 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331990276] [2019-10-22 09:02:44,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:44,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:44,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:44,187 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 09:02:44,187 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331990276] [2019-10-22 09:02:44,187 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:44,187 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:44,187 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500159007] [2019-10-22 09:02:44,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:44,189 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:44,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:44,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:44,190 INFO L87 Difference]: Start difference. First operand 171 states and 277 transitions. Second operand 3 states. [2019-10-22 09:02:44,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:44,368 INFO L93 Difference]: Finished difference Result 384 states and 631 transitions. [2019-10-22 09:02:44,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:44,369 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-22 09:02:44,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:44,371 INFO L225 Difference]: With dead ends: 384 [2019-10-22 09:02:44,371 INFO L226 Difference]: Without dead ends: 218 [2019-10-22 09:02:44,372 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 09:02:44,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2019-10-22 09:02:44,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 212. [2019-10-22 09:02:44,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2019-10-22 09:02:44,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 354 transitions. [2019-10-22 09:02:44,399 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 354 transitions. Word has length 45 [2019-10-22 09:02:44,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:44,399 INFO L462 AbstractCegarLoop]: Abstraction has 212 states and 354 transitions. [2019-10-22 09:02:44,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:44,400 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 354 transitions. [2019-10-22 09:02:44,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-22 09:02:44,401 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:44,402 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:44,402 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:44,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:44,402 INFO L82 PathProgramCache]: Analyzing trace with hash 1767942993, now seen corresponding path program 1 times [2019-10-22 09:02:44,403 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:44,403 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540502112] [2019-10-22 09:02:44,403 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:44,403 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:44,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:44,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:44,504 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:44,505 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540502112] [2019-10-22 09:02:44,505 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:44,505 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:44,505 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065796230] [2019-10-22 09:02:44,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:44,506 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:44,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:44,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:44,507 INFO L87 Difference]: Start difference. First operand 212 states and 354 transitions. Second operand 3 states. [2019-10-22 09:02:44,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:44,689 INFO L93 Difference]: Finished difference Result 448 states and 755 transitions. [2019-10-22 09:02:44,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:44,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-10-22 09:02:44,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:44,692 INFO L225 Difference]: With dead ends: 448 [2019-10-22 09:02:44,692 INFO L226 Difference]: Without dead ends: 243 [2019-10-22 09:02:44,693 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 09:02:44,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2019-10-22 09:02:44,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2019-10-22 09:02:44,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2019-10-22 09:02:44,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 410 transitions. [2019-10-22 09:02:44,708 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 410 transitions. Word has length 73 [2019-10-22 09:02:44,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:44,708 INFO L462 AbstractCegarLoop]: Abstraction has 243 states and 410 transitions. [2019-10-22 09:02:44,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:44,708 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 410 transitions. [2019-10-22 09:02:44,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 09:02:44,711 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:44,711 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:44,711 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:44,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:44,712 INFO L82 PathProgramCache]: Analyzing trace with hash -409474745, now seen corresponding path program 1 times [2019-10-22 09:02:44,712 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:44,716 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216270322] [2019-10-22 09:02:44,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:44,716 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:44,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:44,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:44,770 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:44,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216270322] [2019-10-22 09:02:44,771 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:44,771 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:44,771 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550174802] [2019-10-22 09:02:44,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:44,772 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:44,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:44,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:44,773 INFO L87 Difference]: Start difference. First operand 243 states and 410 transitions. Second operand 3 states. [2019-10-22 09:02:44,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:44,969 INFO L93 Difference]: Finished difference Result 525 states and 891 transitions. [2019-10-22 09:02:44,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:44,969 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-10-22 09:02:44,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:44,971 INFO L225 Difference]: With dead ends: 525 [2019-10-22 09:02:44,971 INFO L226 Difference]: Without dead ends: 289 [2019-10-22 09:02:44,971 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 09:02:44,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-10-22 09:02:44,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 285. [2019-10-22 09:02:44,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2019-10-22 09:02:44,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 485 transitions. [2019-10-22 09:02:44,986 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 485 transitions. Word has length 84 [2019-10-22 09:02:44,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:44,987 INFO L462 AbstractCegarLoop]: Abstraction has 285 states and 485 transitions. [2019-10-22 09:02:44,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:44,987 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 485 transitions. [2019-10-22 09:02:44,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-22 09:02:44,989 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:44,989 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:44,989 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:44,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:44,990 INFO L82 PathProgramCache]: Analyzing trace with hash -1510819865, now seen corresponding path program 1 times [2019-10-22 09:02:44,990 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:44,990 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267612481] [2019-10-22 09:02:44,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:44,990 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:44,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:45,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:45,041 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 09:02:45,043 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267612481] [2019-10-22 09:02:45,044 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:45,044 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:45,044 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883593538] [2019-10-22 09:02:45,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:45,045 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:45,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:45,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:45,045 INFO L87 Difference]: Start difference. First operand 285 states and 485 transitions. Second operand 3 states. [2019-10-22 09:02:45,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:45,182 INFO L93 Difference]: Finished difference Result 580 states and 987 transitions. [2019-10-22 09:02:45,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:45,183 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-10-22 09:02:45,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:45,184 INFO L225 Difference]: With dead ends: 580 [2019-10-22 09:02:45,184 INFO L226 Difference]: Without dead ends: 302 [2019-10-22 09:02:45,185 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 09:02:45,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-10-22 09:02:45,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2019-10-22 09:02:45,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2019-10-22 09:02:45,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 507 transitions. [2019-10-22 09:02:45,196 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 507 transitions. Word has length 85 [2019-10-22 09:02:45,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:45,196 INFO L462 AbstractCegarLoop]: Abstraction has 300 states and 507 transitions. [2019-10-22 09:02:45,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:45,197 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 507 transitions. [2019-10-22 09:02:45,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-10-22 09:02:45,198 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:45,198 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:45,198 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:45,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:45,199 INFO L82 PathProgramCache]: Analyzing trace with hash 556901760, now seen corresponding path program 1 times [2019-10-22 09:02:45,199 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:45,199 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698441258] [2019-10-22 09:02:45,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:45,199 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:45,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:45,251 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:02:45,251 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698441258] [2019-10-22 09:02:45,251 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:45,251 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:45,252 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021513313] [2019-10-22 09:02:45,252 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:45,252 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:45,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:45,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:45,253 INFO L87 Difference]: Start difference. First operand 300 states and 507 transitions. Second operand 3 states. [2019-10-22 09:02:45,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:45,409 INFO L93 Difference]: Finished difference Result 597 states and 1008 transitions. [2019-10-22 09:02:45,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:45,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-10-22 09:02:45,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:45,411 INFO L225 Difference]: With dead ends: 597 [2019-10-22 09:02:45,411 INFO L226 Difference]: Without dead ends: 302 [2019-10-22 09:02:45,411 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 09:02:45,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-10-22 09:02:45,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 298. [2019-10-22 09:02:45,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-10-22 09:02:45,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 502 transitions. [2019-10-22 09:02:45,421 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 502 transitions. Word has length 85 [2019-10-22 09:02:45,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:45,421 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 502 transitions. [2019-10-22 09:02:45,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:45,421 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 502 transitions. [2019-10-22 09:02:45,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-10-22 09:02:45,422 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:45,422 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:45,423 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:45,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:45,423 INFO L82 PathProgramCache]: Analyzing trace with hash 134586867, now seen corresponding path program 1 times [2019-10-22 09:02:45,423 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:45,423 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861757584] [2019-10-22 09:02:45,423 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:45,424 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:45,424 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:45,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:45,450 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 09:02:45,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861757584] [2019-10-22 09:02:45,451 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:45,451 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:45,451 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549205411] [2019-10-22 09:02:45,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:45,452 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:45,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:45,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:45,452 INFO L87 Difference]: Start difference. First operand 298 states and 502 transitions. Second operand 3 states. [2019-10-22 09:02:45,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:45,562 INFO L93 Difference]: Finished difference Result 591 states and 995 transitions. [2019-10-22 09:02:45,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:45,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-10-22 09:02:45,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:45,564 INFO L225 Difference]: With dead ends: 591 [2019-10-22 09:02:45,564 INFO L226 Difference]: Without dead ends: 300 [2019-10-22 09:02:45,565 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 09:02:45,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2019-10-22 09:02:45,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 298. [2019-10-22 09:02:45,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 298 states. [2019-10-22 09:02:45,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 498 transitions. [2019-10-22 09:02:45,573 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 498 transitions. Word has length 86 [2019-10-22 09:02:45,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:45,574 INFO L462 AbstractCegarLoop]: Abstraction has 298 states and 498 transitions. [2019-10-22 09:02:45,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:45,574 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 498 transitions. [2019-10-22 09:02:45,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-22 09:02:45,575 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:45,575 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:45,575 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:45,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:45,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1345174066, now seen corresponding path program 1 times [2019-10-22 09:02:45,576 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:45,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46854292] [2019-10-22 09:02:45,576 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:45,577 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:45,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:45,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:45,604 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-22 09:02:45,604 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46854292] [2019-10-22 09:02:45,604 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:45,604 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:45,605 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984354931] [2019-10-22 09:02:45,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:45,605 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:45,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:45,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:45,606 INFO L87 Difference]: Start difference. First operand 298 states and 498 transitions. Second operand 3 states. [2019-10-22 09:02:45,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:45,712 INFO L93 Difference]: Finished difference Result 598 states and 997 transitions. [2019-10-22 09:02:45,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:45,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-10-22 09:02:45,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:45,713 INFO L225 Difference]: With dead ends: 598 [2019-10-22 09:02:45,714 INFO L226 Difference]: Without dead ends: 307 [2019-10-22 09:02:45,714 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 09:02:45,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2019-10-22 09:02:45,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2019-10-22 09:02:45,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2019-10-22 09:02:45,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 504 transitions. [2019-10-22 09:02:45,728 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 504 transitions. Word has length 99 [2019-10-22 09:02:45,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:45,728 INFO L462 AbstractCegarLoop]: Abstraction has 307 states and 504 transitions. [2019-10-22 09:02:45,729 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:45,729 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 504 transitions. [2019-10-22 09:02:45,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-22 09:02:45,730 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:45,730 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:45,730 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:45,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:45,730 INFO L82 PathProgramCache]: Analyzing trace with hash 414047818, now seen corresponding path program 1 times [2019-10-22 09:02:45,731 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:45,731 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403658374] [2019-10-22 09:02:45,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:45,731 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:45,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:45,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:45,764 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 09:02:45,764 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403658374] [2019-10-22 09:02:45,764 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:45,764 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:45,764 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121462486] [2019-10-22 09:02:45,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:45,765 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:45,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:45,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:45,765 INFO L87 Difference]: Start difference. First operand 307 states and 504 transitions. Second operand 3 states. [2019-10-22 09:02:45,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:45,913 INFO L93 Difference]: Finished difference Result 638 states and 1050 transitions. [2019-10-22 09:02:45,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:45,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-10-22 09:02:45,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:45,915 INFO L225 Difference]: With dead ends: 638 [2019-10-22 09:02:45,916 INFO L226 Difference]: Without dead ends: 338 [2019-10-22 09:02:45,916 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 09:02:45,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-10-22 09:02:45,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-10-22 09:02:45,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-10-22 09:02:45,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 551 transitions. [2019-10-22 09:02:45,929 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 551 transitions. Word has length 99 [2019-10-22 09:02:45,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:45,931 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 551 transitions. [2019-10-22 09:02:45,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:45,932 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 551 transitions. [2019-10-22 09:02:45,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-10-22 09:02:45,933 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:45,933 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-10-22 09:02:45,933 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:45,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:45,933 INFO L82 PathProgramCache]: Analyzing trace with hash -728621130, now seen corresponding path program 1 times [2019-10-22 09:02:45,933 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:45,934 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824805388] [2019-10-22 09:02:45,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:45,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:45,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:45,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:45,978 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 09:02:45,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824805388] [2019-10-22 09:02:45,979 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:45,979 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:45,979 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216532381] [2019-10-22 09:02:45,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:45,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:45,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:45,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:45,980 INFO L87 Difference]: Start difference. First operand 336 states and 551 transitions. Second operand 3 states. [2019-10-22 09:02:46,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:46,129 INFO L93 Difference]: Finished difference Result 667 states and 1093 transitions. [2019-10-22 09:02:46,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:46,130 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-10-22 09:02:46,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:46,131 INFO L225 Difference]: With dead ends: 667 [2019-10-22 09:02:46,131 INFO L226 Difference]: Without dead ends: 338 [2019-10-22 09:02:46,132 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 09:02:46,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2019-10-22 09:02:46,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2019-10-22 09:02:46,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2019-10-22 09:02:46,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 547 transitions. [2019-10-22 09:02:46,141 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 547 transitions. Word has length 100 [2019-10-22 09:02:46,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:46,142 INFO L462 AbstractCegarLoop]: Abstraction has 336 states and 547 transitions. [2019-10-22 09:02:46,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:46,142 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 547 transitions. [2019-10-22 09:02:46,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-10-22 09:02:46,143 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:46,143 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:46,143 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:46,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:46,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1946943846, now seen corresponding path program 1 times [2019-10-22 09:02:46,144 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:46,144 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162735774] [2019-10-22 09:02:46,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:46,144 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:46,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:46,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:46,172 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 09:02:46,172 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162735774] [2019-10-22 09:02:46,172 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:46,172 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:46,172 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113267207] [2019-10-22 09:02:46,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:46,173 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:46,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:46,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:46,173 INFO L87 Difference]: Start difference. First operand 336 states and 547 transitions. Second operand 3 states. [2019-10-22 09:02:46,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:46,301 INFO L93 Difference]: Finished difference Result 700 states and 1143 transitions. [2019-10-22 09:02:46,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:46,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-10-22 09:02:46,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:46,303 INFO L225 Difference]: With dead ends: 700 [2019-10-22 09:02:46,303 INFO L226 Difference]: Without dead ends: 371 [2019-10-22 09:02:46,304 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 09:02:46,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-10-22 09:02:46,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-10-22 09:02:46,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-10-22 09:02:46,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 589 transitions. [2019-10-22 09:02:46,315 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 589 transitions. Word has length 101 [2019-10-22 09:02:46,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:46,315 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 589 transitions. [2019-10-22 09:02:46,316 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:46,316 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 589 transitions. [2019-10-22 09:02:46,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-10-22 09:02:46,317 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:46,317 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:46,317 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:46,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:46,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1829577626, now seen corresponding path program 1 times [2019-10-22 09:02:46,318 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:46,318 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033194880] [2019-10-22 09:02:46,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:46,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:46,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:46,343 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-22 09:02:46,343 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033194880] [2019-10-22 09:02:46,344 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:46,344 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:46,344 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623312151] [2019-10-22 09:02:46,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:46,344 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:46,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:46,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:46,345 INFO L87 Difference]: Start difference. First operand 363 states and 589 transitions. Second operand 3 states. [2019-10-22 09:02:46,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:46,476 INFO L93 Difference]: Finished difference Result 727 states and 1180 transitions. [2019-10-22 09:02:46,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:46,477 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-10-22 09:02:46,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:46,478 INFO L225 Difference]: With dead ends: 727 [2019-10-22 09:02:46,478 INFO L226 Difference]: Without dead ends: 371 [2019-10-22 09:02:46,479 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 09:02:46,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2019-10-22 09:02:46,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 363. [2019-10-22 09:02:46,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2019-10-22 09:02:46,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 584 transitions. [2019-10-22 09:02:46,491 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 584 transitions. Word has length 102 [2019-10-22 09:02:46,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:46,491 INFO L462 AbstractCegarLoop]: Abstraction has 363 states and 584 transitions. [2019-10-22 09:02:46,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:46,491 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 584 transitions. [2019-10-22 09:02:46,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-22 09:02:46,492 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:46,493 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:46,493 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:46,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:46,493 INFO L82 PathProgramCache]: Analyzing trace with hash -932592104, now seen corresponding path program 1 times [2019-10-22 09:02:46,493 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:46,493 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766577869] [2019-10-22 09:02:46,493 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:46,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:46,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:46,518 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-22 09:02:46,518 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766577869] [2019-10-22 09:02:46,518 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:46,518 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:46,519 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709472454] [2019-10-22 09:02:46,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:46,519 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:46,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:46,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:46,520 INFO L87 Difference]: Start difference. First operand 363 states and 584 transitions. Second operand 3 states. [2019-10-22 09:02:46,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:46,644 INFO L93 Difference]: Finished difference Result 744 states and 1198 transitions. [2019-10-22 09:02:46,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:46,647 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-10-22 09:02:46,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:46,648 INFO L225 Difference]: With dead ends: 744 [2019-10-22 09:02:46,648 INFO L226 Difference]: Without dead ends: 388 [2019-10-22 09:02:46,649 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 09:02:46,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-10-22 09:02:46,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 384. [2019-10-22 09:02:46,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-10-22 09:02:46,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 613 transitions. [2019-10-22 09:02:46,662 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 613 transitions. Word has length 105 [2019-10-22 09:02:46,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:46,662 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 613 transitions. [2019-10-22 09:02:46,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:46,663 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 613 transitions. [2019-10-22 09:02:46,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-22 09:02:46,664 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:46,664 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:46,664 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:46,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:46,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1760203780, now seen corresponding path program 1 times [2019-10-22 09:02:46,665 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:46,665 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093543590] [2019-10-22 09:02:46,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:46,665 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:46,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:46,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:46,690 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-22 09:02:46,691 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093543590] [2019-10-22 09:02:46,691 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:46,691 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:02:46,691 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242247746] [2019-10-22 09:02:46,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:46,691 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:46,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:46,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:46,692 INFO L87 Difference]: Start difference. First operand 384 states and 613 transitions. Second operand 3 states. [2019-10-22 09:02:46,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:46,807 INFO L93 Difference]: Finished difference Result 765 states and 1221 transitions. [2019-10-22 09:02:46,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:46,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-10-22 09:02:46,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:46,809 INFO L225 Difference]: With dead ends: 765 [2019-10-22 09:02:46,809 INFO L226 Difference]: Without dead ends: 388 [2019-10-22 09:02:46,810 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 09:02:46,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2019-10-22 09:02:46,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 384. [2019-10-22 09:02:46,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2019-10-22 09:02:46,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 607 transitions. [2019-10-22 09:02:46,821 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 607 transitions. Word has length 106 [2019-10-22 09:02:46,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:46,822 INFO L462 AbstractCegarLoop]: Abstraction has 384 states and 607 transitions. [2019-10-22 09:02:46,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:46,822 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 607 transitions. [2019-10-22 09:02:46,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-22 09:02:46,823 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:46,823 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:46,823 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:46,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:46,824 INFO L82 PathProgramCache]: Analyzing trace with hash -2108241292, now seen corresponding path program 1 times [2019-10-22 09:02:46,824 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:46,824 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639337955] [2019-10-22 09:02:46,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:46,824 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:46,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:02:46,864 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-10-22 09:02:46,865 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639337955] [2019-10-22 09:02:46,865 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:02:46,865 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:02:46,865 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62253324] [2019-10-22 09:02:46,866 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 09:02:46,866 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:02:46,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:02:46,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:02:46,866 INFO L87 Difference]: Start difference. First operand 384 states and 607 transitions. Second operand 3 states. [2019-10-22 09:02:46,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:02:46,907 INFO L93 Difference]: Finished difference Result 1092 states and 1729 transitions. [2019-10-22 09:02:46,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:02:46,907 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-10-22 09:02:46,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:02:46,910 INFO L225 Difference]: With dead ends: 1092 [2019-10-22 09:02:46,910 INFO L226 Difference]: Without dead ends: 715 [2019-10-22 09:02:46,911 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 09:02:46,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2019-10-22 09:02:46,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2019-10-22 09:02:46,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-10-22 09:02:46,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 1127 transitions. [2019-10-22 09:02:46,935 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 1127 transitions. Word has length 121 [2019-10-22 09:02:46,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:02:46,936 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 1127 transitions. [2019-10-22 09:02:46,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 09:02:46,937 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 1127 transitions. [2019-10-22 09:02:46,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-22 09:02:46,938 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:02:46,939 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:02:46,939 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:02:46,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:02:46,939 INFO L82 PathProgramCache]: Analyzing trace with hash -58853450, now seen corresponding path program 1 times [2019-10-22 09:02:46,939 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:02:46,939 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725868635] [2019-10-22 09:02:46,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:46,940 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:02:46,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:02:46,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:46,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:02:47,024 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:02:47,025 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 09:02:47,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 09:02:47 BoogieIcfgContainer [2019-10-22 09:02:47,084 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 09:02:47,084 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:02:47,084 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:02:47,084 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:02:47,085 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:02:43" (3/4) ... [2019-10-22 09:02:47,086 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 09:02:47,217 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_8a8182f5-ef5e-4fd8-8f06-50f5c2ca4944/bin/uautomizer/witness.graphml [2019-10-22 09:02:47,221 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:02:47,223 INFO L168 Benchmark]: Toolchain (without parser) took 5019.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.4 MB). Free memory was 944.5 MB in the beginning and 1.2 GB in the end (delta: -243.2 MB). Peak memory consumption was 264.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:47,223 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:02:47,223 INFO L168 Benchmark]: CACSL2BoogieTranslator took 380.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:47,224 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.38 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 09:02:47,224 INFO L168 Benchmark]: Boogie Preprocessor took 59.00 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 09:02:47,224 INFO L168 Benchmark]: RCFGBuilder took 783.98 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: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:47,224 INFO L168 Benchmark]: TraceAbstraction took 3603.04 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 880.2 MB in the end (delta: 186.7 MB). Peak memory consumption was 240.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:47,225 INFO L168 Benchmark]: Witness Printer took 136.91 ms. Allocated memory is still 1.2 GB. Free memory was 880.2 MB in the beginning and 1.2 GB in the end (delta: -307.5 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:02:47,226 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 962.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 380.34 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.9 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -183.6 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.38 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 59.00 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 783.98 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: 55.9 MB). Peak memory consumption was 55.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3603.04 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 53.5 MB). Free memory was 1.1 GB in the beginning and 880.2 MB in the end (delta: 186.7 MB). Peak memory consumption was 240.1 MB. Max. memory is 11.5 GB. * Witness Printer took 136.91 ms. Allocated memory is still 1.2 GB. Free memory was 880.2 MB in the beginning and 1.2 GB in the end (delta: -307.5 MB). Peak memory consumption was 7.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 612]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L617] int s ; [L618] int tmp ; [L622] s = 8464 [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__hit = __VERIFIER_nondet_int() ; [L21] int s__rwstate ; [L22] int s__init_buf___0 = 1; [L23] int s__debug = __VERIFIER_nondet_int() ; [L24] int s__shutdown ; [L25] int s__cert = __VERIFIER_nondet_int() ; [L26] int s__options = __VERIFIER_nondet_int() ; [L27] int s__verify_mode = __VERIFIER_nondet_int() ; [L28] int s__session__peer = __VERIFIER_nondet_int() ; [L29] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L30] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L34] int s__s3__tmp__cert_request ; [L35] int s__s3__tmp__reuse_message = __VERIFIER_nondet_int() ; [L36] int s__s3__tmp__use_rsa_tmp ; [L37] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() ; [L39] int s__s3__tmp__next_state___0 ; [L40] int s__s3__tmp__new_cipher__algo_strength = __VERIFIER_nondet_int() ; [L41] int s__session__cipher ; [L42] int buf = __VERIFIER_nondet_int() ; [L43] unsigned long l ; [L44] unsigned long Time ; [L45] unsigned long tmp = __VERIFIER_nondet_long() ; [L46] int cb ; [L47] long num1 ; [L48] int ret ; [L49] int new_state ; [L50] int state ; [L51] int skip ; [L52] int got_new_session ; [L53] int tmp___1 = __VERIFIER_nondet_int() ; [L54] int tmp___2 = __VERIFIER_nondet_int() ; [L55] int tmp___3 ; [L56] int tmp___4 ; [L57] int tmp___5 ; [L58] int tmp___6 ; [L59] int tmp___7 ; [L60] long tmp___8 = __VERIFIER_nondet_long() ; [L61] int tmp___9 ; [L62] int tmp___10 ; [L63] int blastFlag ; [L64] int __cil_tmp55 ; [L65] unsigned long __cil_tmp56 ; [L66] unsigned long __cil_tmp57 ; [L67] unsigned long __cil_tmp58 ; [L68] unsigned long __cil_tmp59 ; [L69] int __cil_tmp60 ; [L70] unsigned long __cil_tmp61 ; [L74] s__state = initial_state [L75] blastFlag = 0 [L76] Time = tmp [L77] cb = 0 [L78] ret = -1 [L79] skip = 0 [L80] got_new_session = 0 [L81] COND TRUE s__info_callback != 0 [L82] cb = s__info_callback [L88] s__in_handshake ++ [L89] COND FALSE !(tmp___1 + 12288) [L94] COND FALSE !(s__cert == 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 == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND TRUE s__state == 8464 [L269] s__shutdown = 0 [L270] ret = __VERIFIER_nondet_int() [L271] COND TRUE blastFlag == 0 [L272] blastFlag = 1 [L274] COND FALSE !(ret <= 0) [L277] got_new_session = 1 [L278] s__state = 8496 [L279] s__init_num = 0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L601] 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 == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND TRUE s__state == 8496 [L283] ret = __VERIFIER_nondet_int() [L284] COND TRUE blastFlag == 1 [L285] blastFlag = 2 [L287] COND FALSE !(ret <= 0) [L290] COND TRUE \read(s__hit) [L291] s__state = 8656 [L295] s__init_num = 0 [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L601] 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 == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND FALSE !(s__state == 8528) [L149] COND FALSE !(s__state == 8529) [L152] COND FALSE !(s__state == 8544) [L155] COND FALSE !(s__state == 8545) [L158] COND FALSE !(s__state == 8560) [L161] COND FALSE !(s__state == 8561) [L164] COND FALSE !(s__state == 8448) [L167] COND FALSE !(s__state == 8576) [L170] COND FALSE !(s__state == 8577) [L173] COND FALSE !(s__state == 8592) [L176] COND FALSE !(s__state == 8593) [L179] COND FALSE !(s__state == 8608) [L182] COND FALSE !(s__state == 8609) [L185] COND FALSE !(s__state == 8640) [L188] COND FALSE !(s__state == 8641) [L191] COND TRUE s__state == 8656 [L489] s__session__cipher = s__s3__tmp__new_cipher [L490] tmp___9 = __VERIFIER_nondet_int() [L491] COND FALSE !(! tmp___9) [L495] ret = __VERIFIER_nondet_int() [L496] COND TRUE blastFlag == 2 [L497] blastFlag = 3 [L499] COND FALSE !(ret <= 0) [L502] s__state = 8672 [L503] s__init_num = 0 [L504] tmp___10 = __VERIFIER_nondet_int() [L505] COND FALSE !(! tmp___10) [L584] COND FALSE !(! s__s3__tmp__reuse_message) [L601] 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 == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND FALSE !(s__state == 8496) [L137] COND FALSE !(s__state == 8497) [L140] COND FALSE !(s__state == 8512) [L143] COND FALSE !(s__state == 8513) [L146] COND FALSE !(s__state == 8528) [L149] COND FALSE !(s__state == 8529) [L152] COND FALSE !(s__state == 8544) [L155] COND FALSE !(s__state == 8545) [L158] COND FALSE !(s__state == 8560) [L161] COND FALSE !(s__state == 8561) [L164] COND FALSE !(s__state == 8448) [L167] COND FALSE !(s__state == 8576) [L170] COND FALSE !(s__state == 8577) [L173] COND FALSE !(s__state == 8592) [L176] COND FALSE !(s__state == 8593) [L179] COND FALSE !(s__state == 8608) [L182] COND FALSE !(s__state == 8609) [L185] COND FALSE !(s__state == 8640) [L188] COND FALSE !(s__state == 8641) [L191] COND FALSE !(s__state == 8656) [L194] COND FALSE !(s__state == 8657) [L197] COND TRUE s__state == 8672 [L512] ret = __VERIFIER_nondet_int() [L513] COND FALSE !(blastFlag == 4) [L516] COND TRUE blastFlag == 3 [L612] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 142 locations, 1 error locations. Result: UNSAFE, OverallTime: 3.5s, OverallIterations: 16, TraceHistogramMax: 4, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2210 SDtfs, 2216 SDslu, 420 SDs, 0 SdLazy, 1340 SolverSat, 604 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=715occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 52 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 1456 NumberOfCodeBlocks, 1456 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1320 ConstructedInterpolants, 0 QuantifiedInterpolants, 218070 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 736/736 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...