./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_srvr_13.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8f2c66a1-0f39-4831-823d-2d128d4e7647/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8f2c66a1-0f39-4831-823d-2d128d4e7647/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8f2c66a1-0f39-4831-823d-2d128d4e7647/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8f2c66a1-0f39-4831-823d-2d128d4e7647/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_srvr_13.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8f2c66a1-0f39-4831-823d-2d128d4e7647/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8f2c66a1-0f39-4831-823d-2d128d4e7647/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 a4ba7a359047c30b647e3fae146392c1b2eaa08f ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:57:28,478 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:57:28,480 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:57:28,494 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:57:28,494 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:57:28,495 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:57:28,497 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:57:28,504 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:57:28,509 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:57:28,513 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:57:28,513 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:57:28,515 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:57:28,515 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:57:28,517 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:57:28,518 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:57:28,519 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:57:28,520 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:57:28,520 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:57:28,522 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:57:28,526 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:57:28,529 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:57:28,532 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:57:28,534 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:57:28,534 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:57:28,537 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:57:28,537 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:57:28,537 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:57:28,538 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:57:28,539 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:57:28,540 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:57:28,540 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:57:28,540 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:57:28,541 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:57:28,542 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:57:28,542 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:57:28,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:57:28,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:57:28,543 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:57:28,543 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:57:28,544 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:57:28,545 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:57:28,546 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8f2c66a1-0f39-4831-823d-2d128d4e7647/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:57:28,571 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:57:28,571 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:57:28,572 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:57:28,572 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:57:28,572 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:57:28,572 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:57:28,572 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:57:28,573 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:57:28,573 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:57:28,573 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:57:28,573 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:57:28,573 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:57:28,573 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:57:28,574 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:57:28,574 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:57:28,574 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:57:28,574 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:57:28,574 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:57:28,575 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:57:28,575 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:57:28,575 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:57:28,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:57:28,575 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:57:28,575 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:57:28,576 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:57:28,576 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:57:28,576 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:57:28,576 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:57:28,576 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/run_dir_8f2c66a1-0f39-4831-823d-2d128d4e7647/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 -> a4ba7a359047c30b647e3fae146392c1b2eaa08f [2019-11-25 08:57:28,739 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:57:28,753 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:57:28,756 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:57:28,760 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:57:28,764 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:57:28,766 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8f2c66a1-0f39-4831-823d-2d128d4e7647/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_srvr_13.cil.c [2019-11-25 08:57:28,820 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8f2c66a1-0f39-4831-823d-2d128d4e7647/bin/uautomizer/data/a9ec7ce35/0ff4198928904546879f6dbe5e9e2d44/FLAGf4fc501c4 [2019-11-25 08:57:29,234 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:57:29,235 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8f2c66a1-0f39-4831-823d-2d128d4e7647/sv-benchmarks/c/ssh-simplified/s3_srvr_13.cil.c [2019-11-25 08:57:29,245 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8f2c66a1-0f39-4831-823d-2d128d4e7647/bin/uautomizer/data/a9ec7ce35/0ff4198928904546879f6dbe5e9e2d44/FLAGf4fc501c4 [2019-11-25 08:57:29,256 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8f2c66a1-0f39-4831-823d-2d128d4e7647/bin/uautomizer/data/a9ec7ce35/0ff4198928904546879f6dbe5e9e2d44 [2019-11-25 08:57:29,259 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:57:29,260 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:57:29,261 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:57:29,261 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:57:29,264 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:57:29,265 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:57:29" (1/1) ... [2019-11-25 08:57:29,267 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21d30fa5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:29, skipping insertion in model container [2019-11-25 08:57:29,267 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:57:29" (1/1) ... [2019-11-25 08:57:29,274 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:57:29,309 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:57:29,617 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:57:29,620 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:57:29,698 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:57:29,717 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:57:29,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:29 WrapperNode [2019-11-25 08:57:29,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:57:29,718 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:57:29,718 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:57:29,719 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:57:29,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:29" (1/1) ... [2019-11-25 08:57:29,735 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:29" (1/1) ... [2019-11-25 08:57:29,771 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:57:29,771 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:57:29,771 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:57:29,772 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:57:29,780 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:29" (1/1) ... [2019-11-25 08:57:29,780 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:29" (1/1) ... [2019-11-25 08:57:29,784 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:29" (1/1) ... [2019-11-25 08:57:29,785 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:29" (1/1) ... [2019-11-25 08:57:29,795 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:29" (1/1) ... [2019-11-25 08:57:29,805 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:29" (1/1) ... [2019-11-25 08:57:29,809 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:29" (1/1) ... [2019-11-25 08:57:29,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:57:29,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:57:29,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:57:29,813 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:57:29,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:29" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8f2c66a1-0f39-4831-823d-2d128d4e7647/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-11-25 08:57:29,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:57:29,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:57:29,992 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 08:57:30,549 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-25 08:57:30,550 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-25 08:57:30,551 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:57:30,551 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:57:30,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:57:30 BoogieIcfgContainer [2019-11-25 08:57:30,552 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:57:30,553 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:57:30,553 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:57:30,555 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:57:30,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:57:29" (1/3) ... [2019-11-25 08:57:30,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a39dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:57:30, skipping insertion in model container [2019-11-25 08:57:30,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:57:29" (2/3) ... [2019-11-25 08:57:30,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a39dee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:57:30, skipping insertion in model container [2019-11-25 08:57:30,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:57:30" (3/3) ... [2019-11-25 08:57:30,559 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_13.cil.c [2019-11-25 08:57:30,568 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:57:30,574 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:57:30,584 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:57:30,616 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:57:30,616 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:57:30,616 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:57:30,617 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:57:30,617 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:57:30,617 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:57:30,617 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:57:30,617 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:57:30,634 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states. [2019-11-25 08:57:30,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-25 08:57:30,640 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:30,641 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:30,641 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:30,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:30,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1440243157, now seen corresponding path program 1 times [2019-11-25 08:57:30,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:30,651 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709769150] [2019-11-25 08:57:30,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:30,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:30,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709769150] [2019-11-25 08:57:30,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:30,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:57:30,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020736811] [2019-11-25 08:57:30,821 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:30,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:30,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:30,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:30,836 INFO L87 Difference]: Start difference. First operand 152 states. Second operand 3 states. [2019-11-25 08:57:31,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:31,061 INFO L93 Difference]: Finished difference Result 324 states and 556 transitions. [2019-11-25 08:57:31,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:31,062 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-25 08:57:31,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:31,074 INFO L225 Difference]: With dead ends: 324 [2019-11-25 08:57:31,074 INFO L226 Difference]: Without dead ends: 159 [2019-11-25 08:57:31,078 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:31,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2019-11-25 08:57:31,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2019-11-25 08:57:31,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2019-11-25 08:57:31,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 248 transitions. [2019-11-25 08:57:31,122 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 248 transitions. Word has length 25 [2019-11-25 08:57:31,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:31,122 INFO L462 AbstractCegarLoop]: Abstraction has 157 states and 248 transitions. [2019-11-25 08:57:31,122 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:31,122 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 248 transitions. [2019-11-25 08:57:31,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-25 08:57:31,124 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:31,124 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:31,124 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:31,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:31,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1818183234, now seen corresponding path program 1 times [2019-11-25 08:57:31,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:31,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720930297] [2019-11-25 08:57:31,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:31,171 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:31,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720930297] [2019-11-25 08:57:31,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:31,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:57:31,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055034961] [2019-11-25 08:57:31,173 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:31,173 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:31,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:31,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:31,174 INFO L87 Difference]: Start difference. First operand 157 states and 248 transitions. Second operand 3 states. [2019-11-25 08:57:31,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:31,354 INFO L93 Difference]: Finished difference Result 329 states and 518 transitions. [2019-11-25 08:57:31,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:31,355 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-25 08:57:31,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:31,357 INFO L225 Difference]: With dead ends: 329 [2019-11-25 08:57:31,358 INFO L226 Difference]: Without dead ends: 179 [2019-11-25 08:57:31,359 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:31,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2019-11-25 08:57:31,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2019-11-25 08:57:31,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-11-25 08:57:31,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 278 transitions. [2019-11-25 08:57:31,392 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 278 transitions. Word has length 26 [2019-11-25 08:57:31,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:31,393 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 278 transitions. [2019-11-25 08:57:31,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:31,393 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 278 transitions. [2019-11-25 08:57:31,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-25 08:57:31,394 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:31,394 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:31,395 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:31,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:31,395 INFO L82 PathProgramCache]: Analyzing trace with hash -1920661961, now seen corresponding path program 1 times [2019-11-25 08:57:31,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:31,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096594408] [2019-11-25 08:57:31,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:31,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:31,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:31,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096594408] [2019-11-25 08:57:31,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:31,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:57:31,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361251493] [2019-11-25 08:57:31,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:31,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:31,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:31,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:31,458 INFO L87 Difference]: Start difference. First operand 179 states and 278 transitions. Second operand 3 states. [2019-11-25 08:57:31,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:31,623 INFO L93 Difference]: Finished difference Result 359 states and 559 transitions. [2019-11-25 08:57:31,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:31,625 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-25 08:57:31,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:31,627 INFO L225 Difference]: With dead ends: 359 [2019-11-25 08:57:31,627 INFO L226 Difference]: Without dead ends: 187 [2019-11-25 08:57:31,629 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:31,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-11-25 08:57:31,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2019-11-25 08:57:31,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-25 08:57:31,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 289 transitions. [2019-11-25 08:57:31,660 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 289 transitions. Word has length 26 [2019-11-25 08:57:31,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:31,661 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 289 transitions. [2019-11-25 08:57:31,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:31,662 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 289 transitions. [2019-11-25 08:57:31,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-25 08:57:31,665 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:31,666 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:31,666 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:31,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:31,666 INFO L82 PathProgramCache]: Analyzing trace with hash -304150793, now seen corresponding path program 1 times [2019-11-25 08:57:31,667 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:31,667 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834826533] [2019-11-25 08:57:31,667 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:31,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:31,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:31,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834826533] [2019-11-25 08:57:31,750 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:31,750 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:57:31,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068947556] [2019-11-25 08:57:31,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:31,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:31,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:31,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:31,752 INFO L87 Difference]: Start difference. First operand 185 states and 289 transitions. Second operand 3 states. [2019-11-25 08:57:31,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:31,916 INFO L93 Difference]: Finished difference Result 364 states and 569 transitions. [2019-11-25 08:57:31,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:31,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-25 08:57:31,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:31,918 INFO L225 Difference]: With dead ends: 364 [2019-11-25 08:57:31,919 INFO L226 Difference]: Without dead ends: 186 [2019-11-25 08:57:31,920 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:31,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2019-11-25 08:57:31,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2019-11-25 08:57:31,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-25 08:57:31,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 290 transitions. [2019-11-25 08:57:31,933 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 290 transitions. Word has length 26 [2019-11-25 08:57:31,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:31,934 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 290 transitions. [2019-11-25 08:57:31,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:31,934 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 290 transitions. [2019-11-25 08:57:31,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-25 08:57:31,935 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:31,936 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:31,936 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:31,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:31,936 INFO L82 PathProgramCache]: Analyzing trace with hash 2065347919, now seen corresponding path program 1 times [2019-11-25 08:57:31,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:31,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215372512] [2019-11-25 08:57:31,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:31,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:31,974 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215372512] [2019-11-25 08:57:31,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:31,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:57:31,975 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895047668] [2019-11-25 08:57:31,975 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:31,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:31,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:31,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:31,976 INFO L87 Difference]: Start difference. First operand 186 states and 290 transitions. Second operand 3 states. [2019-11-25 08:57:32,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:32,110 INFO L93 Difference]: Finished difference Result 375 states and 581 transitions. [2019-11-25 08:57:32,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:32,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-25 08:57:32,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:32,112 INFO L225 Difference]: With dead ends: 375 [2019-11-25 08:57:32,112 INFO L226 Difference]: Without dead ends: 196 [2019-11-25 08:57:32,113 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:32,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-25 08:57:32,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 186. [2019-11-25 08:57:32,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-25 08:57:32,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 288 transitions. [2019-11-25 08:57:32,130 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 288 transitions. Word has length 27 [2019-11-25 08:57:32,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:32,131 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 288 transitions. [2019-11-25 08:57:32,131 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:32,131 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 288 transitions. [2019-11-25 08:57:32,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-25 08:57:32,133 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:32,133 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:32,134 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:32,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:32,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1768037659, now seen corresponding path program 1 times [2019-11-25 08:57:32,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:32,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253630023] [2019-11-25 08:57:32,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:32,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:32,206 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253630023] [2019-11-25 08:57:32,206 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:32,207 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:57:32,207 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117356581] [2019-11-25 08:57:32,207 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:32,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:32,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:32,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:32,208 INFO L87 Difference]: Start difference. First operand 186 states and 288 transitions. Second operand 3 states. [2019-11-25 08:57:32,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:32,359 INFO L93 Difference]: Finished difference Result 375 states and 577 transitions. [2019-11-25 08:57:32,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:32,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-25 08:57:32,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:32,361 INFO L225 Difference]: With dead ends: 375 [2019-11-25 08:57:32,362 INFO L226 Difference]: Without dead ends: 196 [2019-11-25 08:57:32,362 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:32,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-25 08:57:32,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 186. [2019-11-25 08:57:32,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-25 08:57:32,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 286 transitions. [2019-11-25 08:57:32,376 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 286 transitions. Word has length 28 [2019-11-25 08:57:32,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:32,376 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 286 transitions. [2019-11-25 08:57:32,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:32,377 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 286 transitions. [2019-11-25 08:57:32,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-25 08:57:32,383 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:32,388 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:32,388 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:32,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:32,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1213962132, now seen corresponding path program 1 times [2019-11-25 08:57:32,389 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:32,389 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268133731] [2019-11-25 08:57:32,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:32,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:32,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:32,431 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268133731] [2019-11-25 08:57:32,431 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:32,431 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:57:32,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414070567] [2019-11-25 08:57:32,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:32,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:32,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:32,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:32,433 INFO L87 Difference]: Start difference. First operand 186 states and 286 transitions. Second operand 3 states. [2019-11-25 08:57:32,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:32,554 INFO L93 Difference]: Finished difference Result 375 states and 573 transitions. [2019-11-25 08:57:32,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:32,554 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-25 08:57:32,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:32,556 INFO L225 Difference]: With dead ends: 375 [2019-11-25 08:57:32,556 INFO L226 Difference]: Without dead ends: 196 [2019-11-25 08:57:32,557 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:32,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-25 08:57:32,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 186. [2019-11-25 08:57:32,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-25 08:57:32,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 284 transitions. [2019-11-25 08:57:32,566 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 284 transitions. Word has length 29 [2019-11-25 08:57:32,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:32,568 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 284 transitions. [2019-11-25 08:57:32,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:32,568 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 284 transitions. [2019-11-25 08:57:32,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-25 08:57:32,570 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:32,570 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:32,570 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:32,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:32,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1639645429, now seen corresponding path program 1 times [2019-11-25 08:57:32,571 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:32,572 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296408489] [2019-11-25 08:57:32,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:32,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:32,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296408489] [2019-11-25 08:57:32,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:32,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:57:32,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725170432] [2019-11-25 08:57:32,650 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:57:32,650 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:32,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:57:32,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:57:32,651 INFO L87 Difference]: Start difference. First operand 186 states and 284 transitions. Second operand 4 states. [2019-11-25 08:57:32,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:32,916 INFO L93 Difference]: Finished difference Result 571 states and 870 transitions. [2019-11-25 08:57:32,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:57:32,917 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2019-11-25 08:57:32,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:32,920 INFO L225 Difference]: With dead ends: 571 [2019-11-25 08:57:32,920 INFO L226 Difference]: Without dead ends: 392 [2019-11-25 08:57:32,920 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:57:32,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2019-11-25 08:57:32,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 356. [2019-11-25 08:57:32,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-25 08:57:32,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 542 transitions. [2019-11-25 08:57:32,943 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 542 transitions. Word has length 29 [2019-11-25 08:57:32,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:32,944 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 542 transitions. [2019-11-25 08:57:32,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:57:32,944 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 542 transitions. [2019-11-25 08:57:32,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-25 08:57:32,945 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:32,945 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:32,945 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:32,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:32,946 INFO L82 PathProgramCache]: Analyzing trace with hash -356314719, now seen corresponding path program 1 times [2019-11-25 08:57:32,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:32,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329002981] [2019-11-25 08:57:32,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:32,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:32,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:32,992 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329002981] [2019-11-25 08:57:32,992 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:32,992 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:57:32,993 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890982501] [2019-11-25 08:57:32,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:32,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:32,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:32,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:32,993 INFO L87 Difference]: Start difference. First operand 356 states and 542 transitions. Second operand 3 states. [2019-11-25 08:57:33,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:33,166 INFO L93 Difference]: Finished difference Result 780 states and 1196 transitions. [2019-11-25 08:57:33,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:33,166 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-11-25 08:57:33,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:33,169 INFO L225 Difference]: With dead ends: 780 [2019-11-25 08:57:33,170 INFO L226 Difference]: Without dead ends: 431 [2019-11-25 08:57:33,170 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:33,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-11-25 08:57:33,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 411. [2019-11-25 08:57:33,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2019-11-25 08:57:33,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 629 transitions. [2019-11-25 08:57:33,191 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 629 transitions. Word has length 32 [2019-11-25 08:57:33,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:33,191 INFO L462 AbstractCegarLoop]: Abstraction has 411 states and 629 transitions. [2019-11-25 08:57:33,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:33,191 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 629 transitions. [2019-11-25 08:57:33,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-25 08:57:33,193 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:33,193 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:33,193 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:33,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:33,194 INFO L82 PathProgramCache]: Analyzing trace with hash 863724629, now seen corresponding path program 1 times [2019-11-25 08:57:33,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:33,194 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881625632] [2019-11-25 08:57:33,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:33,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:33,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:33,244 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881625632] [2019-11-25 08:57:33,244 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:33,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:57:33,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785996159] [2019-11-25 08:57:33,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:33,245 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:33,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:33,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:33,245 INFO L87 Difference]: Start difference. First operand 411 states and 629 transitions. Second operand 3 states. [2019-11-25 08:57:33,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:33,395 INFO L93 Difference]: Finished difference Result 857 states and 1320 transitions. [2019-11-25 08:57:33,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:33,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2019-11-25 08:57:33,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:33,401 INFO L225 Difference]: With dead ends: 857 [2019-11-25 08:57:33,401 INFO L226 Difference]: Without dead ends: 453 [2019-11-25 08:57:33,402 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:33,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-11-25 08:57:33,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 433. [2019-11-25 08:57:33,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-11-25 08:57:33,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 669 transitions. [2019-11-25 08:57:33,423 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 669 transitions. Word has length 33 [2019-11-25 08:57:33,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:33,425 INFO L462 AbstractCegarLoop]: Abstraction has 433 states and 669 transitions. [2019-11-25 08:57:33,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:33,425 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 669 transitions. [2019-11-25 08:57:33,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-25 08:57:33,426 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:33,427 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:33,427 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:33,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:33,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1579131601, now seen corresponding path program 1 times [2019-11-25 08:57:33,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:33,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613578961] [2019-11-25 08:57:33,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:33,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:33,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:33,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613578961] [2019-11-25 08:57:33,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:33,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:57:33,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569738658] [2019-11-25 08:57:33,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:33,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:33,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:33,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:33,463 INFO L87 Difference]: Start difference. First operand 433 states and 669 transitions. Second operand 3 states. [2019-11-25 08:57:33,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:33,649 INFO L93 Difference]: Finished difference Result 924 states and 1432 transitions. [2019-11-25 08:57:33,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:33,650 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-25 08:57:33,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:33,653 INFO L225 Difference]: With dead ends: 924 [2019-11-25 08:57:33,653 INFO L226 Difference]: Without dead ends: 498 [2019-11-25 08:57:33,654 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:33,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2019-11-25 08:57:33,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 488. [2019-11-25 08:57:33,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-11-25 08:57:33,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 759 transitions. [2019-11-25 08:57:33,675 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 759 transitions. Word has length 39 [2019-11-25 08:57:33,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:33,675 INFO L462 AbstractCegarLoop]: Abstraction has 488 states and 759 transitions. [2019-11-25 08:57:33,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:33,676 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 759 transitions. [2019-11-25 08:57:33,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-11-25 08:57:33,676 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:33,677 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:33,677 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:33,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:33,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1701430936, now seen corresponding path program 1 times [2019-11-25 08:57:33,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:33,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914746703] [2019-11-25 08:57:33,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:33,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:33,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:33,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914746703] [2019-11-25 08:57:33,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:33,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:57:33,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721758927] [2019-11-25 08:57:33,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:33,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:33,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:33,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:33,717 INFO L87 Difference]: Start difference. First operand 488 states and 759 transitions. Second operand 3 states. [2019-11-25 08:57:33,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:33,910 INFO L93 Difference]: Finished difference Result 991 states and 1544 transitions. [2019-11-25 08:57:33,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:33,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-11-25 08:57:33,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:33,914 INFO L225 Difference]: With dead ends: 991 [2019-11-25 08:57:33,914 INFO L226 Difference]: Without dead ends: 510 [2019-11-25 08:57:33,914 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:33,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2019-11-25 08:57:33,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 500. [2019-11-25 08:57:33,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-11-25 08:57:33,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 781 transitions. [2019-11-25 08:57:33,934 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 781 transitions. Word has length 40 [2019-11-25 08:57:33,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:33,935 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 781 transitions. [2019-11-25 08:57:33,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:33,935 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 781 transitions. [2019-11-25 08:57:33,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-25 08:57:33,936 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:33,936 INFO L410 BasicCegarLoop]: trace histogram [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-11-25 08:57:33,936 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:33,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:33,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1491732218, now seen corresponding path program 1 times [2019-11-25 08:57:33,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:33,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126629511] [2019-11-25 08:57:33,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:33,964 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:33,964 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126629511] [2019-11-25 08:57:33,964 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:33,964 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:57:33,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586403759] [2019-11-25 08:57:33,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:33,965 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:33,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:33,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:33,965 INFO L87 Difference]: Start difference. First operand 500 states and 781 transitions. Second operand 3 states. [2019-11-25 08:57:34,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:34,106 INFO L93 Difference]: Finished difference Result 1007 states and 1574 transitions. [2019-11-25 08:57:34,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:34,106 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-11-25 08:57:34,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:34,109 INFO L225 Difference]: With dead ends: 1007 [2019-11-25 08:57:34,110 INFO L226 Difference]: Without dead ends: 514 [2019-11-25 08:57:34,110 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:34,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2019-11-25 08:57:34,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 500. [2019-11-25 08:57:34,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 500 states. [2019-11-25 08:57:34,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 777 transitions. [2019-11-25 08:57:34,130 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 777 transitions. Word has length 60 [2019-11-25 08:57:34,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:34,130 INFO L462 AbstractCegarLoop]: Abstraction has 500 states and 777 transitions. [2019-11-25 08:57:34,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:34,130 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 777 transitions. [2019-11-25 08:57:34,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-25 08:57:34,131 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:34,132 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-25 08:57:34,132 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:34,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:34,132 INFO L82 PathProgramCache]: Analyzing trace with hash -892846741, now seen corresponding path program 1 times [2019-11-25 08:57:34,133 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:34,133 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038168252] [2019-11-25 08:57:34,133 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:34,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:34,157 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-25 08:57:34,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038168252] [2019-11-25 08:57:34,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:34,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:57:34,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777330506] [2019-11-25 08:57:34,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:34,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:34,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:34,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:34,159 INFO L87 Difference]: Start difference. First operand 500 states and 777 transitions. Second operand 3 states. [2019-11-25 08:57:34,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:34,295 INFO L93 Difference]: Finished difference Result 1035 states and 1604 transitions. [2019-11-25 08:57:34,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:34,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-25 08:57:34,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:34,298 INFO L225 Difference]: With dead ends: 1035 [2019-11-25 08:57:34,299 INFO L226 Difference]: Without dead ends: 542 [2019-11-25 08:57:34,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:34,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2019-11-25 08:57:34,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 532. [2019-11-25 08:57:34,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2019-11-25 08:57:34,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 820 transitions. [2019-11-25 08:57:34,323 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 820 transitions. Word has length 61 [2019-11-25 08:57:34,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:34,323 INFO L462 AbstractCegarLoop]: Abstraction has 532 states and 820 transitions. [2019-11-25 08:57:34,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:34,323 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 820 transitions. [2019-11-25 08:57:34,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-25 08:57:34,325 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:34,325 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-25 08:57:34,325 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:34,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:34,326 INFO L82 PathProgramCache]: Analyzing trace with hash 27094997, now seen corresponding path program 1 times [2019-11-25 08:57:34,326 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:34,326 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97156012] [2019-11-25 08:57:34,326 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:34,351 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:34,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97156012] [2019-11-25 08:57:34,351 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:34,351 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:57:34,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238707788] [2019-11-25 08:57:34,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:34,352 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:34,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:34,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:34,352 INFO L87 Difference]: Start difference. First operand 532 states and 820 transitions. Second operand 3 states. [2019-11-25 08:57:34,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:34,503 INFO L93 Difference]: Finished difference Result 1095 states and 1685 transitions. [2019-11-25 08:57:34,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:34,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-25 08:57:34,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:34,507 INFO L225 Difference]: With dead ends: 1095 [2019-11-25 08:57:34,507 INFO L226 Difference]: Without dead ends: 570 [2019-11-25 08:57:34,508 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:34,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-11-25 08:57:34,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 570. [2019-11-25 08:57:34,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2019-11-25 08:57:34,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 873 transitions. [2019-11-25 08:57:34,532 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 873 transitions. Word has length 61 [2019-11-25 08:57:34,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:34,532 INFO L462 AbstractCegarLoop]: Abstraction has 570 states and 873 transitions. [2019-11-25 08:57:34,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:34,532 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 873 transitions. [2019-11-25 08:57:34,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-11-25 08:57:34,533 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:34,533 INFO L410 BasicCegarLoop]: trace histogram [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-11-25 08:57:34,534 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:34,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:34,534 INFO L82 PathProgramCache]: Analyzing trace with hash -1141694985, now seen corresponding path program 1 times [2019-11-25 08:57:34,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:34,534 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212139562] [2019-11-25 08:57:34,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:34,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:34,565 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-25 08:57:34,565 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212139562] [2019-11-25 08:57:34,565 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:34,565 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:57:34,568 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901198589] [2019-11-25 08:57:34,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:34,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:34,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:34,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:34,569 INFO L87 Difference]: Start difference. First operand 570 states and 873 transitions. Second operand 3 states. [2019-11-25 08:57:34,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:34,707 INFO L93 Difference]: Finished difference Result 1143 states and 1749 transitions. [2019-11-25 08:57:34,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:34,707 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-11-25 08:57:34,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:34,711 INFO L225 Difference]: With dead ends: 1143 [2019-11-25 08:57:34,711 INFO L226 Difference]: Without dead ends: 580 [2019-11-25 08:57:34,712 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:34,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2019-11-25 08:57:34,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 570. [2019-11-25 08:57:34,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2019-11-25 08:57:34,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 868 transitions. [2019-11-25 08:57:34,735 INFO L78 Accepts]: Start accepts. Automaton has 570 states and 868 transitions. Word has length 62 [2019-11-25 08:57:34,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:34,736 INFO L462 AbstractCegarLoop]: Abstraction has 570 states and 868 transitions. [2019-11-25 08:57:34,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:34,736 INFO L276 IsEmpty]: Start isEmpty. Operand 570 states and 868 transitions. [2019-11-25 08:57:34,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-11-25 08:57:34,737 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:34,737 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:34,737 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:34,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:34,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1688729156, now seen corresponding path program 1 times [2019-11-25 08:57:34,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:34,738 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541373302] [2019-11-25 08:57:34,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:34,768 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:34,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541373302] [2019-11-25 08:57:34,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:34,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:57:34,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248240881] [2019-11-25 08:57:34,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:34,770 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:34,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:34,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:34,770 INFO L87 Difference]: Start difference. First operand 570 states and 868 transitions. Second operand 3 states. [2019-11-25 08:57:34,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:34,939 INFO L93 Difference]: Finished difference Result 1180 states and 1793 transitions. [2019-11-25 08:57:34,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:34,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-11-25 08:57:34,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:34,943 INFO L225 Difference]: With dead ends: 1180 [2019-11-25 08:57:34,943 INFO L226 Difference]: Without dead ends: 617 [2019-11-25 08:57:34,944 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:34,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-11-25 08:57:34,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2019-11-25 08:57:34,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-11-25 08:57:34,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 929 transitions. [2019-11-25 08:57:34,972 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 929 transitions. Word has length 73 [2019-11-25 08:57:34,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:34,972 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 929 transitions. [2019-11-25 08:57:34,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:34,972 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 929 transitions. [2019-11-25 08:57:34,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-11-25 08:57:34,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:34,974 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:34,974 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:34,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:34,974 INFO L82 PathProgramCache]: Analyzing trace with hash -628849429, now seen corresponding path program 1 times [2019-11-25 08:57:34,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:34,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309747561] [2019-11-25 08:57:34,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:34,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:35,012 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:57:35,013 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309747561] [2019-11-25 08:57:35,013 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:35,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:57:35,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905753449] [2019-11-25 08:57:35,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:35,014 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:35,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:35,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:35,019 INFO L87 Difference]: Start difference. First operand 613 states and 929 transitions. Second operand 3 states. [2019-11-25 08:57:35,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:35,201 INFO L93 Difference]: Finished difference Result 1223 states and 1851 transitions. [2019-11-25 08:57:35,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:35,202 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-11-25 08:57:35,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:35,205 INFO L225 Difference]: With dead ends: 1223 [2019-11-25 08:57:35,205 INFO L226 Difference]: Without dead ends: 617 [2019-11-25 08:57:35,206 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:35,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-11-25 08:57:35,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 613. [2019-11-25 08:57:35,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-11-25 08:57:35,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 926 transitions. [2019-11-25 08:57:35,237 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 926 transitions. Word has length 74 [2019-11-25 08:57:35,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:35,237 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 926 transitions. [2019-11-25 08:57:35,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:35,237 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 926 transitions. [2019-11-25 08:57:35,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-25 08:57:35,239 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:35,239 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2019-11-25 08:57:35,239 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:35,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:35,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1361446465, now seen corresponding path program 1 times [2019-11-25 08:57:35,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:35,240 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373760749] [2019-11-25 08:57:35,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:35,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:35,268 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-25 08:57:35,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373760749] [2019-11-25 08:57:35,269 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:35,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:57:35,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260595743] [2019-11-25 08:57:35,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:35,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:35,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:35,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:35,270 INFO L87 Difference]: Start difference. First operand 613 states and 926 transitions. Second operand 3 states. [2019-11-25 08:57:35,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:35,410 INFO L93 Difference]: Finished difference Result 1255 states and 1894 transitions. [2019-11-25 08:57:35,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:35,410 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-25 08:57:35,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:35,414 INFO L225 Difference]: With dead ends: 1255 [2019-11-25 08:57:35,414 INFO L226 Difference]: Without dead ends: 649 [2019-11-25 08:57:35,415 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:35,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-11-25 08:57:35,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 641. [2019-11-25 08:57:35,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-11-25 08:57:35,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 960 transitions. [2019-11-25 08:57:35,443 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 960 transitions. Word has length 83 [2019-11-25 08:57:35,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:35,443 INFO L462 AbstractCegarLoop]: Abstraction has 641 states and 960 transitions. [2019-11-25 08:57:35,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:35,443 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 960 transitions. [2019-11-25 08:57:35,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-25 08:57:35,445 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:35,445 INFO L410 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1] [2019-11-25 08:57:35,445 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:35,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:35,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1716915501, now seen corresponding path program 1 times [2019-11-25 08:57:35,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:35,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083576226] [2019-11-25 08:57:35,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:35,474 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-25 08:57:35,474 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083576226] [2019-11-25 08:57:35,474 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:35,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:57:35,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129183549] [2019-11-25 08:57:35,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:35,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:35,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:35,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:35,476 INFO L87 Difference]: Start difference. First operand 641 states and 960 transitions. Second operand 3 states. [2019-11-25 08:57:35,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:35,625 INFO L93 Difference]: Finished difference Result 1283 states and 1921 transitions. [2019-11-25 08:57:35,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:35,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-25 08:57:35,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:35,630 INFO L225 Difference]: With dead ends: 1283 [2019-11-25 08:57:35,630 INFO L226 Difference]: Without dead ends: 649 [2019-11-25 08:57:35,631 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:35,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2019-11-25 08:57:35,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 641. [2019-11-25 08:57:35,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2019-11-25 08:57:35,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 953 transitions. [2019-11-25 08:57:35,659 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 953 transitions. Word has length 84 [2019-11-25 08:57:35,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:35,659 INFO L462 AbstractCegarLoop]: Abstraction has 641 states and 953 transitions. [2019-11-25 08:57:35,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:35,659 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 953 transitions. [2019-11-25 08:57:35,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-11-25 08:57:35,661 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:35,661 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:35,661 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:35,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:35,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1450581597, now seen corresponding path program 1 times [2019-11-25 08:57:35,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:35,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368494808] [2019-11-25 08:57:35,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:35,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:35,687 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-25 08:57:35,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368494808] [2019-11-25 08:57:35,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:35,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:57:35,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827460174] [2019-11-25 08:57:35,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:35,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:35,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:35,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:35,689 INFO L87 Difference]: Start difference. First operand 641 states and 953 transitions. Second operand 3 states. [2019-11-25 08:57:35,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:35,832 INFO L93 Difference]: Finished difference Result 1315 states and 1948 transitions. [2019-11-25 08:57:35,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:35,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 88 [2019-11-25 08:57:35,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:35,836 INFO L225 Difference]: With dead ends: 1315 [2019-11-25 08:57:35,837 INFO L226 Difference]: Without dead ends: 681 [2019-11-25 08:57:35,838 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:35,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2019-11-25 08:57:35,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 677. [2019-11-25 08:57:35,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-11-25 08:57:35,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 997 transitions. [2019-11-25 08:57:35,866 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 997 transitions. Word has length 88 [2019-11-25 08:57:35,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:35,866 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 997 transitions. [2019-11-25 08:57:35,866 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:35,866 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 997 transitions. [2019-11-25 08:57:35,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-25 08:57:35,868 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:35,868 INFO L410 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] [2019-11-25 08:57:35,868 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:35,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:35,869 INFO L82 PathProgramCache]: Analyzing trace with hash -398439497, now seen corresponding path program 1 times [2019-11-25 08:57:35,869 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:35,869 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375776742] [2019-11-25 08:57:35,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:35,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:35,894 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-11-25 08:57:35,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375776742] [2019-11-25 08:57:35,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:35,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:57:35,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316740627] [2019-11-25 08:57:35,895 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:35,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:35,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:35,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:35,896 INFO L87 Difference]: Start difference. First operand 677 states and 997 transitions. Second operand 3 states. [2019-11-25 08:57:36,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:36,040 INFO L93 Difference]: Finished difference Result 1351 states and 1987 transitions. [2019-11-25 08:57:36,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:36,041 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-25 08:57:36,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:36,045 INFO L225 Difference]: With dead ends: 1351 [2019-11-25 08:57:36,045 INFO L226 Difference]: Without dead ends: 681 [2019-11-25 08:57:36,046 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:36,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2019-11-25 08:57:36,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 677. [2019-11-25 08:57:36,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-11-25 08:57:36,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 992 transitions. [2019-11-25 08:57:36,074 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 992 transitions. Word has length 89 [2019-11-25 08:57:36,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:36,075 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 992 transitions. [2019-11-25 08:57:36,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:36,075 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 992 transitions. [2019-11-25 08:57:36,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-25 08:57:36,077 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:36,077 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:36,077 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:36,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:36,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1868895208, now seen corresponding path program 1 times [2019-11-25 08:57:36,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:36,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349537011] [2019-11-25 08:57:36,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:36,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:36,109 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-25 08:57:36,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349537011] [2019-11-25 08:57:36,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:36,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:57:36,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910873160] [2019-11-25 08:57:36,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:36,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:36,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:36,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:36,111 INFO L87 Difference]: Start difference. First operand 677 states and 992 transitions. Second operand 3 states. [2019-11-25 08:57:36,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:36,177 INFO L93 Difference]: Finished difference Result 2003 states and 2928 transitions. [2019-11-25 08:57:36,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:36,178 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-25 08:57:36,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:36,185 INFO L225 Difference]: With dead ends: 2003 [2019-11-25 08:57:36,185 INFO L226 Difference]: Without dead ends: 1333 [2019-11-25 08:57:36,186 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:36,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1333 states. [2019-11-25 08:57:36,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1333 to 679. [2019-11-25 08:57:36,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2019-11-25 08:57:36,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 994 transitions. [2019-11-25 08:57:36,222 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 994 transitions. Word has length 100 [2019-11-25 08:57:36,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:36,223 INFO L462 AbstractCegarLoop]: Abstraction has 679 states and 994 transitions. [2019-11-25 08:57:36,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:36,223 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 994 transitions. [2019-11-25 08:57:36,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-25 08:57:36,224 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:36,225 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:36,225 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:36,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:36,225 INFO L82 PathProgramCache]: Analyzing trace with hash 589031530, now seen corresponding path program 1 times [2019-11-25 08:57:36,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:36,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779548311] [2019-11-25 08:57:36,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:36,259 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-11-25 08:57:36,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779548311] [2019-11-25 08:57:36,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:36,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:57:36,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545504015] [2019-11-25 08:57:36,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:36,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:36,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:36,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:36,261 INFO L87 Difference]: Start difference. First operand 679 states and 994 transitions. Second operand 3 states. [2019-11-25 08:57:36,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:36,300 INFO L93 Difference]: Finished difference Result 1362 states and 1992 transitions. [2019-11-25 08:57:36,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:36,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-25 08:57:36,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:36,305 INFO L225 Difference]: With dead ends: 1362 [2019-11-25 08:57:36,305 INFO L226 Difference]: Without dead ends: 690 [2019-11-25 08:57:36,306 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:36,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2019-11-25 08:57:36,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 677. [2019-11-25 08:57:36,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2019-11-25 08:57:36,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 987 transitions. [2019-11-25 08:57:36,338 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 987 transitions. Word has length 100 [2019-11-25 08:57:36,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:36,339 INFO L462 AbstractCegarLoop]: Abstraction has 677 states and 987 transitions. [2019-11-25 08:57:36,339 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:36,339 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 987 transitions. [2019-11-25 08:57:36,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-25 08:57:36,341 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:36,341 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:36,341 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:36,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:36,341 INFO L82 PathProgramCache]: Analyzing trace with hash 303396910, now seen corresponding path program 1 times [2019-11-25 08:57:36,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:36,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566395662] [2019-11-25 08:57:36,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:36,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:57:36,379 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-25 08:57:36,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [566395662] [2019-11-25 08:57:36,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:57:36,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:57:36,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136610372] [2019-11-25 08:57:36,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:57:36,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:57:36,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:57:36,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:36,381 INFO L87 Difference]: Start difference. First operand 677 states and 987 transitions. Second operand 3 states. [2019-11-25 08:57:36,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:57:36,467 INFO L93 Difference]: Finished difference Result 2017 states and 2939 transitions. [2019-11-25 08:57:36,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:57:36,467 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-11-25 08:57:36,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:57:36,475 INFO L225 Difference]: With dead ends: 2017 [2019-11-25 08:57:36,475 INFO L226 Difference]: Without dead ends: 1347 [2019-11-25 08:57:36,476 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:57:36,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2019-11-25 08:57:36,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1345. [2019-11-25 08:57:36,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1345 states. [2019-11-25 08:57:36,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 1950 transitions. [2019-11-25 08:57:36,539 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 1950 transitions. Word has length 101 [2019-11-25 08:57:36,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:57:36,539 INFO L462 AbstractCegarLoop]: Abstraction has 1345 states and 1950 transitions. [2019-11-25 08:57:36,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:57:36,540 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 1950 transitions. [2019-11-25 08:57:36,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-25 08:57:36,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:57:36,542 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:57:36,543 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:57:36,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:57:36,543 INFO L82 PathProgramCache]: Analyzing trace with hash -283409104, now seen corresponding path program 1 times [2019-11-25 08:57:36,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:57:36,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828557213] [2019-11-25 08:57:36,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:57:36,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:57:36,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:57:36,629 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:57:36,629 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:57:36,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:57:36 BoogieIcfgContainer [2019-11-25 08:57:36,700 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:57:36,701 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:57:36,701 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:57:36,701 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:57:36,702 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:57:30" (3/4) ... [2019-11-25 08:57:36,704 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-25 08:57:36,803 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8f2c66a1-0f39-4831-823d-2d128d4e7647/bin/uautomizer/witness.graphml [2019-11-25 08:57:36,804 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:57:36,805 INFO L168 Benchmark]: Toolchain (without parser) took 7545.04 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 233.3 MB). Free memory was 951.4 MB in the beginning and 1.0 GB in the end (delta: -97.3 MB). Peak memory consumption was 136.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:57:36,806 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:57:36,806 INFO L168 Benchmark]: CACSL2BoogieTranslator took 457.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -188.8 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. [2019-11-25 08:57:36,806 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.85 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-11-25 08:57:36,807 INFO L168 Benchmark]: Boogie Preprocessor took 41.67 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-11-25 08:57:36,807 INFO L168 Benchmark]: RCFGBuilder took 738.97 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: 61.3 MB). Peak memory consumption was 61.3 MB. Max. memory is 11.5 GB. [2019-11-25 08:57:36,808 INFO L168 Benchmark]: TraceAbstraction took 6147.72 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 82.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.8 MB). Peak memory consumption was 90.1 MB. Max. memory is 11.5 GB. [2019-11-25 08:57:36,808 INFO L168 Benchmark]: Witness Printer took 102.81 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:57:36,810 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 457.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -188.8 MB). Peak memory consumption was 24.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.85 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 41.67 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 738.97 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: 61.3 MB). Peak memory consumption was 61.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6147.72 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 82.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.8 MB). Peak memory consumption was 90.1 MB. Max. memory is 11.5 GB. * Witness Printer took 102.81 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 642]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L647] int s ; [L648] int tmp ; [L652] s = 8464 [L11] int s__info_callback = __VERIFIER_nondet_int() ; [L12] int s__in_handshake = __VERIFIER_nondet_int() ; [L13] int s__state ; [L14] int s__new_session ; [L15] int s__server ; [L16] int s__version = __VERIFIER_nondet_int() ; [L17] int s__type ; [L18] int s__init_num ; [L19] int s__hit = __VERIFIER_nondet_int() ; [L20] int s__rwstate ; [L21] int s__init_buf___0 = 1; [L22] int s__debug = __VERIFIER_nondet_int() ; [L23] int s__shutdown ; [L24] int s__cert = __VERIFIER_nondet_int() ; [L25] int s__options = __VERIFIER_nondet_int() ; [L26] int s__verify_mode = __VERIFIER_nondet_int() ; [L27] int s__session__peer = __VERIFIER_nondet_int() ; [L28] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L29] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L30] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L33] int s__s3__tmp__cert_request ; [L34] int s__s3__tmp__reuse_message ; [L35] int s__s3__tmp__use_rsa_tmp ; [L36] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L37] int s__s3__tmp__new_cipher__algorithms ; [L38] int s__s3__tmp__next_state___0 ; [L39] int s__s3__tmp__new_cipher__algo_strength ; [L40] int s__session__cipher ; [L41] int buf ; [L42] unsigned long l ; [L43] unsigned long Time ; [L44] unsigned long tmp ; [L45] int cb ; [L46] long num1 = __VERIFIER_nondet_long() ; [L47] int ret ; [L48] int new_state ; [L49] int state ; [L50] int skip ; [L51] int got_new_session ; [L52] int tmp___1 = __VERIFIER_nondet_int() ; [L53] int tmp___2 = __VERIFIER_nondet_int() ; [L54] int tmp___3 = __VERIFIER_nondet_int() ; [L55] int tmp___4 = __VERIFIER_nondet_int() ; [L56] int tmp___5 = __VERIFIER_nondet_int() ; [L57] int tmp___6 = __VERIFIER_nondet_int() ; [L58] int tmp___7 = __VERIFIER_nondet_int() ; [L59] long tmp___8 = __VERIFIER_nondet_long() ; [L60] int tmp___9 = __VERIFIER_nondet_int() ; [L61] int tmp___10 = __VERIFIER_nondet_int() ; [L62] int blastFlag ; [L63] int __cil_tmp55 ; [L64] unsigned long __cil_tmp56 ; [L65] unsigned long __cil_tmp57 ; [L66] unsigned long __cil_tmp58 ; [L67] unsigned long __cil_tmp59 ; [L68] int __cil_tmp60 ; [L69] unsigned long __cil_tmp61 ; [L72] s__state = initial_state [L73] blastFlag = 0 [L74] tmp = __VERIFIER_nondet_int() [L75] Time = tmp [L76] cb = 0 [L77] ret = -1 [L78] skip = 0 [L79] got_new_session = 0 [L80] COND TRUE s__info_callback != 0 [L81] cb = s__info_callback [L87] s__in_handshake ++ [L88] COND FALSE !(tmp___1 + 12288) [L93] COND FALSE !(s__cert == 0) [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND TRUE s__state == 8464 [L270] s__shutdown = 0 [L271] ret = __VERIFIER_nondet_int() [L272] COND TRUE blastFlag == 0 [L273] blastFlag = 1 [L275] COND FALSE !(ret <= 0) [L278] got_new_session = 1 [L279] s__state = 8496 [L280] s__init_num = 0 [L599] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L600] COND FALSE !(! s__s3__tmp__reuse_message) [L631] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND FALSE !(s__state == 8464) [L127] COND FALSE !(s__state == 8465) [L130] COND FALSE !(s__state == 8466) [L133] COND TRUE s__state == 8496 [L284] ret = __VERIFIER_nondet_int() [L285] COND TRUE blastFlag == 1 [L286] blastFlag = 2 [L288] COND FALSE !(ret <= 0) [L291] COND FALSE !(\read(s__hit)) [L294] s__state = 8512 [L296] s__init_num = 0 [L599] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L600] COND FALSE !(! s__s3__tmp__reuse_message) [L631] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND FALSE !(s__state == 8464) [L127] COND FALSE !(s__state == 8465) [L130] COND FALSE !(s__state == 8466) [L133] COND FALSE !(s__state == 8496) [L136] COND FALSE !(s__state == 8497) [L139] COND TRUE s__state == 8512 [L301] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L302] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L303] COND TRUE __cil_tmp56 + 256UL [L304] skip = 1 [L315] s__state = 8528 [L316] s__init_num = 0 [L599] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L600] COND FALSE !(! s__s3__tmp__reuse_message) [L631] skip = 0 [L97] COND TRUE 1 [L99] state = s__state [L100] COND FALSE !(s__state == 12292) [L103] COND FALSE !(s__state == 16384) [L106] COND FALSE !(s__state == 8192) [L109] COND FALSE !(s__state == 24576) [L112] COND FALSE !(s__state == 8195) [L115] COND FALSE !(s__state == 8480) [L118] COND FALSE !(s__state == 8481) [L121] COND FALSE !(s__state == 8482) [L124] COND FALSE !(s__state == 8464) [L127] COND FALSE !(s__state == 8465) [L130] COND FALSE !(s__state == 8466) [L133] COND FALSE !(s__state == 8496) [L136] COND FALSE !(s__state == 8497) [L139] COND FALSE !(s__state == 8512) [L142] COND FALSE !(s__state == 8513) [L145] COND TRUE s__state == 8528 [L320] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L321] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L323] __cil_tmp57 = (unsigned long )s__options [L324] COND TRUE __cil_tmp57 + 2097152UL [L325] s__s3__tmp__use_rsa_tmp = 1 [L330] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L357] ret = __VERIFIER_nondet_int() [L358] COND FALSE !(blastFlag == 6) [L361] COND FALSE !(ret <= 0) [L378] s__state = 8544 [L379] s__init_num = 0 [L599] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L600] COND TRUE ! s__s3__tmp__reuse_message [L601] COND TRUE ! skip [L602] COND TRUE state == 8528 [L603] COND TRUE s__state == 8544 [L604] COND TRUE tmp___7 != 1024 [L605] COND TRUE tmp___7 != 512 [L606] COND TRUE __cil_tmp58 != 4294967294 [L607] COND TRUE l != 4294967266 [L642] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 152 locations, 1 error locations. Result: UNSAFE, OverallTime: 6.0s, OverallIterations: 26, TraceHistogramMax: 4, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4244 SDtfs, 4375 SDslu, 1279 SDs, 0 SdLazy, 2053 SolverSat, 917 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 55 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1345occurred in iteration=25, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 865 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1497 NumberOfCodeBlocks, 1497 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1371 ConstructedInterpolants, 0 QuantifiedInterpolants, 179497 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 646/646 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...