./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-1.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_cf28dfe5-697a-4053-97df-34f008469770/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_cf28dfe5-697a-4053-97df-34f008469770/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_cf28dfe5-697a-4053-97df-34f008469770/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_cf28dfe5-697a-4053-97df-34f008469770/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_cf28dfe5-697a-4053-97df-34f008469770/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_cf28dfe5-697a-4053-97df-34f008469770/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 5377418547a5706dafa6030007433e8164dafce8 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-25 08:46:15,229 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:46:15,230 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:46:15,244 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:46:15,244 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:46:15,245 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:46:15,247 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:46:15,255 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:46:15,259 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:46:15,263 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:46:15,264 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:46:15,265 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:46:15,265 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:46:15,267 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:46:15,268 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:46:15,269 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:46:15,270 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:46:15,271 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:46:15,273 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:46:15,277 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:46:15,280 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:46:15,283 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:46:15,285 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:46:15,285 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:46:15,287 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:46:15,288 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:46:15,288 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:46:15,289 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:46:15,290 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:46:15,291 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:46:15,291 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:46:15,292 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:46:15,293 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:46:15,293 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:46:15,294 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:46:15,294 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:46:15,295 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:46:15,295 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:46:15,295 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:46:15,296 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:46:15,297 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:46:15,298 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_cf28dfe5-697a-4053-97df-34f008469770/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:46:15,321 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:46:15,331 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:46:15,332 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:46:15,332 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:46:15,332 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:46:15,333 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:46:15,333 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:46:15,333 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:46:15,333 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:46:15,333 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:46:15,334 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:46:15,334 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:46:15,334 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:46:15,334 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:46:15,334 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:46:15,335 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:46:15,335 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:46:15,335 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:46:15,335 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:46:15,336 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:46:15,336 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:46:15,336 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:46:15,336 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:46:15,336 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:46:15,337 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:46:15,337 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:46:15,337 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:46:15,337 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:46:15,337 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_cf28dfe5-697a-4053-97df-34f008469770/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 -> 5377418547a5706dafa6030007433e8164dafce8 [2019-11-25 08:46:15,509 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:46:15,522 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:46:15,525 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:46:15,526 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:46:15,526 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:46:15,527 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_cf28dfe5-697a-4053-97df-34f008469770/bin/uautomizer/../../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-1.c [2019-11-25 08:46:15,586 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cf28dfe5-697a-4053-97df-34f008469770/bin/uautomizer/data/99db3080b/b623baae6ddc4047b981cf31e746474c/FLAGb74ba1d82 [2019-11-25 08:46:16,045 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:46:16,045 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_cf28dfe5-697a-4053-97df-34f008469770/sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-1.c [2019-11-25 08:46:16,059 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cf28dfe5-697a-4053-97df-34f008469770/bin/uautomizer/data/99db3080b/b623baae6ddc4047b981cf31e746474c/FLAGb74ba1d82 [2019-11-25 08:46:16,392 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_cf28dfe5-697a-4053-97df-34f008469770/bin/uautomizer/data/99db3080b/b623baae6ddc4047b981cf31e746474c [2019-11-25 08:46:16,396 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:46:16,397 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:46:16,398 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:46:16,398 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:46:16,401 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:46:16,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:46:16" (1/1) ... [2019-11-25 08:46:16,404 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71caa7e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:16, skipping insertion in model container [2019-11-25 08:46:16,404 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:46:16" (1/1) ... [2019-11-25 08:46:16,411 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:46:16,445 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:46:16,729 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:46:16,732 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:46:16,785 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:46:16,812 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:46:16,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:16 WrapperNode [2019-11-25 08:46:16,813 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:46:16,814 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:46:16,814 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:46:16,814 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:46:16,821 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:46:16" (1/1) ... [2019-11-25 08:46:16,828 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:46:16" (1/1) ... [2019-11-25 08:46:16,881 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:46:16,881 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:46:16,881 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:46:16,881 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:46:16,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:16" (1/1) ... [2019-11-25 08:46:16,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:16" (1/1) ... [2019-11-25 08:46:16,909 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:16" (1/1) ... [2019-11-25 08:46:16,910 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:16" (1/1) ... [2019-11-25 08:46:16,916 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:16" (1/1) ... [2019-11-25 08:46:16,930 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:16" (1/1) ... [2019-11-25 08:46:16,940 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:16" (1/1) ... [2019-11-25 08:46:16,943 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:46:16,950 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:46:16,951 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:46:16,951 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:46:16,952 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cf28dfe5-697a-4053-97df-34f008469770/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:46:17,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:46:17,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:46:17,166 WARN L735 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-25 08:46:17,771 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-25 08:46:17,771 INFO L688 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-25 08:46:17,772 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:46:17,772 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-25 08:46:17,773 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:46:17 BoogieIcfgContainer [2019-11-25 08:46:17,773 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:46:17,783 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:46:17,783 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:46:17,785 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:46:17,794 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:46:16" (1/3) ... [2019-11-25 08:46:17,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4763bc82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:46:17, skipping insertion in model container [2019-11-25 08:46:17,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:46:16" (2/3) ... [2019-11-25 08:46:17,795 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4763bc82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:46:17, skipping insertion in model container [2019-11-25 08:46:17,795 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:46:17" (3/3) ... [2019-11-25 08:46:17,797 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-1.c [2019-11-25 08:46:17,805 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:46:17,825 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:46:17,844 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:46:17,866 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:46:17,867 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:46:17,867 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:46:17,867 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:46:17,867 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:46:17,867 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:46:17,868 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:46:17,868 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:46:17,886 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states. [2019-11-25 08:46:17,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-25 08:46:17,894 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:17,895 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] [2019-11-25 08:46:17,895 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:17,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:17,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1449578949, now seen corresponding path program 1 times [2019-11-25 08:46:17,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:17,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833729455] [2019-11-25 08:46:17,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:18,047 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:46:18,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833729455] [2019-11-25 08:46:18,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:18,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:46:18,049 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613948069] [2019-11-25 08:46:18,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:18,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:18,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:18,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:18,069 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 3 states. [2019-11-25 08:46:18,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:18,302 INFO L93 Difference]: Finished difference Result 243 states and 418 transitions. [2019-11-25 08:46:18,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:18,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-25 08:46:18,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:18,313 INFO L225 Difference]: With dead ends: 243 [2019-11-25 08:46:18,313 INFO L226 Difference]: Without dead ends: 111 [2019-11-25 08:46:18,316 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:46:18,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2019-11-25 08:46:18,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2019-11-25 08:46:18,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2019-11-25 08:46:18,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 168 transitions. [2019-11-25 08:46:18,365 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 168 transitions. Word has length 23 [2019-11-25 08:46:18,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:18,365 INFO L462 AbstractCegarLoop]: Abstraction has 111 states and 168 transitions. [2019-11-25 08:46:18,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:18,365 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 168 transitions. [2019-11-25 08:46:18,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-25 08:46:18,367 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:18,367 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:18,367 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:18,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:18,368 INFO L82 PathProgramCache]: Analyzing trace with hash 800883515, now seen corresponding path program 1 times [2019-11-25 08:46:18,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:18,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1210855316] [2019-11-25 08:46:18,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:18,441 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:46:18,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1210855316] [2019-11-25 08:46:18,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:18,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:46:18,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62644463] [2019-11-25 08:46:18,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:18,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:18,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:18,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:18,444 INFO L87 Difference]: Start difference. First operand 111 states and 168 transitions. Second operand 3 states. [2019-11-25 08:46:18,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:18,623 INFO L93 Difference]: Finished difference Result 231 states and 353 transitions. [2019-11-25 08:46:18,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:18,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-25 08:46:18,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:18,626 INFO L225 Difference]: With dead ends: 231 [2019-11-25 08:46:18,626 INFO L226 Difference]: Without dead ends: 129 [2019-11-25 08:46:18,627 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:46:18,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2019-11-25 08:46:18,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2019-11-25 08:46:18,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-11-25 08:46:18,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 188 transitions. [2019-11-25 08:46:18,639 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 188 transitions. Word has length 35 [2019-11-25 08:46:18,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:18,639 INFO L462 AbstractCegarLoop]: Abstraction has 126 states and 188 transitions. [2019-11-25 08:46:18,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:18,640 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 188 transitions. [2019-11-25 08:46:18,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-25 08:46:18,641 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:18,642 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:18,642 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:18,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:18,642 INFO L82 PathProgramCache]: Analyzing trace with hash 1382730084, now seen corresponding path program 1 times [2019-11-25 08:46:18,642 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:18,643 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407684027] [2019-11-25 08:46:18,643 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:18,699 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-25 08:46:18,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407684027] [2019-11-25 08:46:18,700 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:18,700 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:46:18,700 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704640963] [2019-11-25 08:46:18,701 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:18,701 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:18,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:18,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:18,701 INFO L87 Difference]: Start difference. First operand 126 states and 188 transitions. Second operand 3 states. [2019-11-25 08:46:18,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:18,871 INFO L93 Difference]: Finished difference Result 265 states and 401 transitions. [2019-11-25 08:46:18,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:18,873 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-25 08:46:18,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:18,875 INFO L225 Difference]: With dead ends: 265 [2019-11-25 08:46:18,875 INFO L226 Difference]: Without dead ends: 148 [2019-11-25 08:46:18,876 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:46:18,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-11-25 08:46:18,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 143. [2019-11-25 08:46:18,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-25 08:46:18,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. [2019-11-25 08:46:18,890 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 210 transitions. Word has length 49 [2019-11-25 08:46:18,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:18,891 INFO L462 AbstractCegarLoop]: Abstraction has 143 states and 210 transitions. [2019-11-25 08:46:18,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:18,891 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 210 transitions. [2019-11-25 08:46:18,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-25 08:46:18,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:18,893 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:18,894 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:18,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:18,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1259053610, now seen corresponding path program 1 times [2019-11-25 08:46:18,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:18,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925733553] [2019-11-25 08:46:18,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:18,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:18,967 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-25 08:46:18,968 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925733553] [2019-11-25 08:46:18,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:18,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:46:18,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356947987] [2019-11-25 08:46:18,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:18,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:18,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:18,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:18,970 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. Second operand 3 states. [2019-11-25 08:46:19,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:19,191 INFO L93 Difference]: Finished difference Result 327 states and 495 transitions. [2019-11-25 08:46:19,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:19,192 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-25 08:46:19,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:19,194 INFO L225 Difference]: With dead ends: 327 [2019-11-25 08:46:19,195 INFO L226 Difference]: Without dead ends: 192 [2019-11-25 08:46:19,196 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:46:19,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2019-11-25 08:46:19,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 184. [2019-11-25 08:46:19,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-11-25 08:46:19,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 260 transitions. [2019-11-25 08:46:19,222 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 260 transitions. Word has length 66 [2019-11-25 08:46:19,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:19,225 INFO L462 AbstractCegarLoop]: Abstraction has 184 states and 260 transitions. [2019-11-25 08:46:19,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:19,225 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 260 transitions. [2019-11-25 08:46:19,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-25 08:46:19,229 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:19,229 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:19,230 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:19,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:19,231 INFO L82 PathProgramCache]: Analyzing trace with hash -546384724, now seen corresponding path program 1 times [2019-11-25 08:46:19,231 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:19,231 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597452588] [2019-11-25 08:46:19,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:19,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:19,305 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-25 08:46:19,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597452588] [2019-11-25 08:46:19,306 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:19,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:46:19,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295611363] [2019-11-25 08:46:19,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:19,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:19,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:19,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:19,308 INFO L87 Difference]: Start difference. First operand 184 states and 260 transitions. Second operand 3 states. [2019-11-25 08:46:19,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:19,448 INFO L93 Difference]: Finished difference Result 382 states and 547 transitions. [2019-11-25 08:46:19,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:19,449 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-25 08:46:19,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:19,451 INFO L225 Difference]: With dead ends: 382 [2019-11-25 08:46:19,451 INFO L226 Difference]: Without dead ends: 207 [2019-11-25 08:46:19,452 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:46:19,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-11-25 08:46:19,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 203. [2019-11-25 08:46:19,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2019-11-25 08:46:19,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 284 transitions. [2019-11-25 08:46:19,464 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 284 transitions. Word has length 66 [2019-11-25 08:46:19,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:19,465 INFO L462 AbstractCegarLoop]: Abstraction has 203 states and 284 transitions. [2019-11-25 08:46:19,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:19,465 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 284 transitions. [2019-11-25 08:46:19,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-25 08:46:19,468 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:19,468 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:19,469 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:19,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:19,469 INFO L82 PathProgramCache]: Analyzing trace with hash 819829122, now seen corresponding path program 1 times [2019-11-25 08:46:19,469 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:19,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625538040] [2019-11-25 08:46:19,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:19,572 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-25 08:46:19,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625538040] [2019-11-25 08:46:19,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:19,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:46:19,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103894731] [2019-11-25 08:46:19,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:19,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:19,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:19,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:19,578 INFO L87 Difference]: Start difference. First operand 203 states and 284 transitions. Second operand 3 states. [2019-11-25 08:46:19,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:19,727 INFO L93 Difference]: Finished difference Result 421 states and 597 transitions. [2019-11-25 08:46:19,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:19,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-25 08:46:19,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:19,730 INFO L225 Difference]: With dead ends: 421 [2019-11-25 08:46:19,730 INFO L226 Difference]: Without dead ends: 227 [2019-11-25 08:46:19,730 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:46:19,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2019-11-25 08:46:19,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2019-11-25 08:46:19,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2019-11-25 08:46:19,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 310 transitions. [2019-11-25 08:46:19,747 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 310 transitions. Word has length 82 [2019-11-25 08:46:19,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:19,748 INFO L462 AbstractCegarLoop]: Abstraction has 224 states and 310 transitions. [2019-11-25 08:46:19,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:19,748 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 310 transitions. [2019-11-25 08:46:19,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-25 08:46:19,750 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:19,750 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:19,750 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:19,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:19,751 INFO L82 PathProgramCache]: Analyzing trace with hash 426015802, now seen corresponding path program 1 times [2019-11-25 08:46:19,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:19,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562183620] [2019-11-25 08:46:19,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:19,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:19,815 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-25 08:46:19,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562183620] [2019-11-25 08:46:19,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:19,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:46:19,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695265790] [2019-11-25 08:46:19,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:19,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:19,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:19,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:19,818 INFO L87 Difference]: Start difference. First operand 224 states and 310 transitions. Second operand 3 states. [2019-11-25 08:46:19,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:19,854 INFO L93 Difference]: Finished difference Result 652 states and 903 transitions. [2019-11-25 08:46:19,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:19,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-25 08:46:19,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:19,858 INFO L225 Difference]: With dead ends: 652 [2019-11-25 08:46:19,858 INFO L226 Difference]: Without dead ends: 437 [2019-11-25 08:46:19,859 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:46:19,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2019-11-25 08:46:19,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 437. [2019-11-25 08:46:19,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-11-25 08:46:19,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 603 transitions. [2019-11-25 08:46:19,875 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 603 transitions. Word has length 102 [2019-11-25 08:46:19,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:19,875 INFO L462 AbstractCegarLoop]: Abstraction has 437 states and 603 transitions. [2019-11-25 08:46:19,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:19,876 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 603 transitions. [2019-11-25 08:46:19,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-25 08:46:19,878 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:19,878 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:19,878 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:19,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:19,879 INFO L82 PathProgramCache]: Analyzing trace with hash -527041180, now seen corresponding path program 1 times [2019-11-25 08:46:19,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:19,879 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575483103] [2019-11-25 08:46:19,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:19,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:19,967 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-25 08:46:19,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575483103] [2019-11-25 08:46:19,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:19,968 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:46:19,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365854402] [2019-11-25 08:46:19,969 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:19,969 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:19,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:19,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:19,969 INFO L87 Difference]: Start difference. First operand 437 states and 603 transitions. Second operand 3 states. [2019-11-25 08:46:20,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:20,017 INFO L93 Difference]: Finished difference Result 652 states and 900 transitions. [2019-11-25 08:46:20,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:20,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-25 08:46:20,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:20,022 INFO L225 Difference]: With dead ends: 652 [2019-11-25 08:46:20,022 INFO L226 Difference]: Without dead ends: 650 [2019-11-25 08:46:20,023 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:46:20,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2019-11-25 08:46:20,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 650. [2019-11-25 08:46:20,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2019-11-25 08:46:20,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 898 transitions. [2019-11-25 08:46:20,040 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 898 transitions. Word has length 104 [2019-11-25 08:46:20,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:20,041 INFO L462 AbstractCegarLoop]: Abstraction has 650 states and 898 transitions. [2019-11-25 08:46:20,041 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:20,041 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 898 transitions. [2019-11-25 08:46:20,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-11-25 08:46:20,044 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:20,044 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:20,044 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:20,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:20,045 INFO L82 PathProgramCache]: Analyzing trace with hash -892474837, now seen corresponding path program 1 times [2019-11-25 08:46:20,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:20,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928790369] [2019-11-25 08:46:20,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:20,116 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-25 08:46:20,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928790369] [2019-11-25 08:46:20,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:20,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:46:20,120 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501097149] [2019-11-25 08:46:20,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:20,121 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:20,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:20,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:20,122 INFO L87 Difference]: Start difference. First operand 650 states and 898 transitions. Second operand 3 states. [2019-11-25 08:46:20,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:20,301 INFO L93 Difference]: Finished difference Result 1441 states and 2047 transitions. [2019-11-25 08:46:20,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:20,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-11-25 08:46:20,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:20,307 INFO L225 Difference]: With dead ends: 1441 [2019-11-25 08:46:20,307 INFO L226 Difference]: Without dead ends: 797 [2019-11-25 08:46:20,308 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:46:20,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-11-25 08:46:20,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 767. [2019-11-25 08:46:20,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 767 states. [2019-11-25 08:46:20,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 1087 transitions. [2019-11-25 08:46:20,333 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 1087 transitions. Word has length 158 [2019-11-25 08:46:20,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:20,333 INFO L462 AbstractCegarLoop]: Abstraction has 767 states and 1087 transitions. [2019-11-25 08:46:20,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:20,333 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 1087 transitions. [2019-11-25 08:46:20,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2019-11-25 08:46:20,336 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:20,337 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:20,337 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:20,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:20,337 INFO L82 PathProgramCache]: Analyzing trace with hash 1787424402, now seen corresponding path program 1 times [2019-11-25 08:46:20,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:20,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435957940] [2019-11-25 08:46:20,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:20,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:20,426 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-11-25 08:46:20,427 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435957940] [2019-11-25 08:46:20,427 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:20,427 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:46:20,427 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773732032] [2019-11-25 08:46:20,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:20,428 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:20,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:20,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:20,433 INFO L87 Difference]: Start difference. First operand 767 states and 1087 transitions. Second operand 3 states. [2019-11-25 08:46:20,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:20,614 INFO L93 Difference]: Finished difference Result 1803 states and 2628 transitions. [2019-11-25 08:46:20,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:20,615 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 184 [2019-11-25 08:46:20,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:20,621 INFO L225 Difference]: With dead ends: 1803 [2019-11-25 08:46:20,621 INFO L226 Difference]: Without dead ends: 994 [2019-11-25 08:46:20,623 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:46:20,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2019-11-25 08:46:20,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 956. [2019-11-25 08:46:20,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 956 states. [2019-11-25 08:46:20,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1339 transitions. [2019-11-25 08:46:20,649 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1339 transitions. Word has length 184 [2019-11-25 08:46:20,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:20,650 INFO L462 AbstractCegarLoop]: Abstraction has 956 states and 1339 transitions. [2019-11-25 08:46:20,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:20,650 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1339 transitions. [2019-11-25 08:46:20,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2019-11-25 08:46:20,654 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:20,654 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:20,654 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:20,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:20,655 INFO L82 PathProgramCache]: Analyzing trace with hash 78119093, now seen corresponding path program 1 times [2019-11-25 08:46:20,655 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:20,655 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634000198] [2019-11-25 08:46:20,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:20,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:20,721 INFO L134 CoverageAnalysis]: Checked inductivity of 657 backedges. 402 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-11-25 08:46:20,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634000198] [2019-11-25 08:46:20,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:20,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:46:20,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648449304] [2019-11-25 08:46:20,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:20,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:20,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:20,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:20,723 INFO L87 Difference]: Start difference. First operand 956 states and 1339 transitions. Second operand 3 states. [2019-11-25 08:46:20,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:20,917 INFO L93 Difference]: Finished difference Result 2059 states and 2905 transitions. [2019-11-25 08:46:20,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:20,918 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 205 [2019-11-25 08:46:20,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:20,924 INFO L225 Difference]: With dead ends: 2059 [2019-11-25 08:46:20,925 INFO L226 Difference]: Without dead ends: 1067 [2019-11-25 08:46:20,926 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:46:20,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2019-11-25 08:46:20,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 1031. [2019-11-25 08:46:20,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1031 states. [2019-11-25 08:46:20,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1031 states to 1031 states and 1435 transitions. [2019-11-25 08:46:20,954 INFO L78 Accepts]: Start accepts. Automaton has 1031 states and 1435 transitions. Word has length 205 [2019-11-25 08:46:20,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:20,955 INFO L462 AbstractCegarLoop]: Abstraction has 1031 states and 1435 transitions. [2019-11-25 08:46:20,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:20,955 INFO L276 IsEmpty]: Start isEmpty. Operand 1031 states and 1435 transitions. [2019-11-25 08:46:20,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-25 08:46:20,959 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:20,959 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:20,959 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:20,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:20,960 INFO L82 PathProgramCache]: Analyzing trace with hash 2106820770, now seen corresponding path program 1 times [2019-11-25 08:46:20,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:20,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507296706] [2019-11-25 08:46:20,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:20,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:21,052 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-25 08:46:21,052 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507296706] [2019-11-25 08:46:21,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:21,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:46:21,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665156064] [2019-11-25 08:46:21,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:21,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:21,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:21,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:21,054 INFO L87 Difference]: Start difference. First operand 1031 states and 1435 transitions. Second operand 3 states. [2019-11-25 08:46:21,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:21,255 INFO L93 Difference]: Finished difference Result 2209 states and 3094 transitions. [2019-11-25 08:46:21,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:21,256 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-11-25 08:46:21,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:21,262 INFO L225 Difference]: With dead ends: 2209 [2019-11-25 08:46:21,263 INFO L226 Difference]: Without dead ends: 1148 [2019-11-25 08:46:21,264 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:46:21,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1148 states. [2019-11-25 08:46:21,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1148 to 1115. [2019-11-25 08:46:21,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1115 states. [2019-11-25 08:46:21,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1115 states to 1115 states and 1546 transitions. [2019-11-25 08:46:21,296 INFO L78 Accepts]: Start accepts. Automaton has 1115 states and 1546 transitions. Word has length 229 [2019-11-25 08:46:21,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:21,296 INFO L462 AbstractCegarLoop]: Abstraction has 1115 states and 1546 transitions. [2019-11-25 08:46:21,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:21,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1115 states and 1546 transitions. [2019-11-25 08:46:21,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2019-11-25 08:46:21,301 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:21,301 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:21,302 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:21,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:21,302 INFO L82 PathProgramCache]: Analyzing trace with hash 73426724, now seen corresponding path program 1 times [2019-11-25 08:46:21,302 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:21,302 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724863336] [2019-11-25 08:46:21,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:21,371 INFO L134 CoverageAnalysis]: Checked inductivity of 805 backedges. 477 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-25 08:46:21,372 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724863336] [2019-11-25 08:46:21,372 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:21,372 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:46:21,373 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025195793] [2019-11-25 08:46:21,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:21,373 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:21,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:21,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:21,374 INFO L87 Difference]: Start difference. First operand 1115 states and 1546 transitions. Second operand 3 states. [2019-11-25 08:46:21,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:21,548 INFO L93 Difference]: Finished difference Result 2377 states and 3319 transitions. [2019-11-25 08:46:21,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:21,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 229 [2019-11-25 08:46:21,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:21,556 INFO L225 Difference]: With dead ends: 2377 [2019-11-25 08:46:21,556 INFO L226 Difference]: Without dead ends: 1244 [2019-11-25 08:46:21,558 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:46:21,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1244 states. [2019-11-25 08:46:21,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1244 to 1208. [2019-11-25 08:46:21,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1208 states. [2019-11-25 08:46:21,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1208 states to 1208 states and 1678 transitions. [2019-11-25 08:46:21,592 INFO L78 Accepts]: Start accepts. Automaton has 1208 states and 1678 transitions. Word has length 229 [2019-11-25 08:46:21,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:21,593 INFO L462 AbstractCegarLoop]: Abstraction has 1208 states and 1678 transitions. [2019-11-25 08:46:21,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:21,593 INFO L276 IsEmpty]: Start isEmpty. Operand 1208 states and 1678 transitions. [2019-11-25 08:46:21,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-11-25 08:46:21,598 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:21,598 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:21,598 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:21,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:21,599 INFO L82 PathProgramCache]: Analyzing trace with hash 837799332, now seen corresponding path program 1 times [2019-11-25 08:46:21,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:21,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728647524] [2019-11-25 08:46:21,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:21,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:21,682 INFO L134 CoverageAnalysis]: Checked inductivity of 973 backedges. 552 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-11-25 08:46:21,682 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728647524] [2019-11-25 08:46:21,683 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:21,683 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:46:21,683 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713370738] [2019-11-25 08:46:21,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:21,684 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:21,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:21,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:21,684 INFO L87 Difference]: Start difference. First operand 1208 states and 1678 transitions. Second operand 3 states. [2019-11-25 08:46:21,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:21,874 INFO L93 Difference]: Finished difference Result 2560 states and 3577 transitions. [2019-11-25 08:46:21,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:21,875 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 259 [2019-11-25 08:46:21,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:21,883 INFO L225 Difference]: With dead ends: 2560 [2019-11-25 08:46:21,883 INFO L226 Difference]: Without dead ends: 1346 [2019-11-25 08:46:21,885 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:46:21,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2019-11-25 08:46:21,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1313. [2019-11-25 08:46:21,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1313 states. [2019-11-25 08:46:21,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1313 states to 1313 states and 1834 transitions. [2019-11-25 08:46:21,922 INFO L78 Accepts]: Start accepts. Automaton has 1313 states and 1834 transitions. Word has length 259 [2019-11-25 08:46:21,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:21,923 INFO L462 AbstractCegarLoop]: Abstraction has 1313 states and 1834 transitions. [2019-11-25 08:46:21,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:21,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1313 states and 1834 transitions. [2019-11-25 08:46:21,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2019-11-25 08:46:21,929 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:21,929 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:21,929 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:21,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:21,930 INFO L82 PathProgramCache]: Analyzing trace with hash 298818312, now seen corresponding path program 1 times [2019-11-25 08:46:21,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:21,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965760959] [2019-11-25 08:46:21,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:22,046 INFO L134 CoverageAnalysis]: Checked inductivity of 1167 backedges. 627 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-11-25 08:46:22,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965760959] [2019-11-25 08:46:22,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:22,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:46:22,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935119661] [2019-11-25 08:46:22,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:22,047 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:22,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:22,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:22,048 INFO L87 Difference]: Start difference. First operand 1313 states and 1834 transitions. Second operand 3 states. [2019-11-25 08:46:22,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:22,253 INFO L93 Difference]: Finished difference Result 2656 states and 3703 transitions. [2019-11-25 08:46:22,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:22,253 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 294 [2019-11-25 08:46:22,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:22,261 INFO L225 Difference]: With dead ends: 2656 [2019-11-25 08:46:22,261 INFO L226 Difference]: Without dead ends: 1343 [2019-11-25 08:46:22,263 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:46:22,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2019-11-25 08:46:22,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1310. [2019-11-25 08:46:22,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1310 states. [2019-11-25 08:46:22,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1816 transitions. [2019-11-25 08:46:22,298 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1816 transitions. Word has length 294 [2019-11-25 08:46:22,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:22,299 INFO L462 AbstractCegarLoop]: Abstraction has 1310 states and 1816 transitions. [2019-11-25 08:46:22,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:22,299 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1816 transitions. [2019-11-25 08:46:22,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2019-11-25 08:46:22,304 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:22,305 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:22,305 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:22,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:22,305 INFO L82 PathProgramCache]: Analyzing trace with hash 430194802, now seen corresponding path program 1 times [2019-11-25 08:46:22,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:22,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131494878] [2019-11-25 08:46:22,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:22,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:22,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1174 backedges. 561 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-25 08:46:22,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131494878] [2019-11-25 08:46:22,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:22,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:46:22,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432594238] [2019-11-25 08:46:22,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:22,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:22,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:22,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:22,411 INFO L87 Difference]: Start difference. First operand 1310 states and 1816 transitions. Second operand 3 states. [2019-11-25 08:46:22,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:22,571 INFO L93 Difference]: Finished difference Result 2638 states and 3652 transitions. [2019-11-25 08:46:22,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:22,572 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 304 [2019-11-25 08:46:22,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:22,579 INFO L225 Difference]: With dead ends: 2638 [2019-11-25 08:46:22,580 INFO L226 Difference]: Without dead ends: 1337 [2019-11-25 08:46:22,582 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:46:22,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1337 states. [2019-11-25 08:46:22,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1337 to 1310. [2019-11-25 08:46:22,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1310 states. [2019-11-25 08:46:22,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1789 transitions. [2019-11-25 08:46:22,618 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1789 transitions. Word has length 304 [2019-11-25 08:46:22,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:22,619 INFO L462 AbstractCegarLoop]: Abstraction has 1310 states and 1789 transitions. [2019-11-25 08:46:22,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:22,619 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1789 transitions. [2019-11-25 08:46:22,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-11-25 08:46:22,625 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:22,625 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:22,626 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:22,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:22,626 INFO L82 PathProgramCache]: Analyzing trace with hash 863432469, now seen corresponding path program 1 times [2019-11-25 08:46:22,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:22,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825381412] [2019-11-25 08:46:22,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:22,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 729 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-25 08:46:22,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825381412] [2019-11-25 08:46:22,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:22,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:46:22,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275220087] [2019-11-25 08:46:22,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:22,737 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:22,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:22,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:22,738 INFO L87 Difference]: Start difference. First operand 1310 states and 1789 transitions. Second operand 3 states. [2019-11-25 08:46:22,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:22,919 INFO L93 Difference]: Finished difference Result 2761 states and 3742 transitions. [2019-11-25 08:46:22,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:22,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 331 [2019-11-25 08:46:22,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:22,927 INFO L225 Difference]: With dead ends: 2761 [2019-11-25 08:46:22,928 INFO L226 Difference]: Without dead ends: 1460 [2019-11-25 08:46:22,930 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:46:22,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1460 states. [2019-11-25 08:46:22,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1460 to 1355. [2019-11-25 08:46:22,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1355 states. [2019-11-25 08:46:22,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1355 states to 1355 states and 1849 transitions. [2019-11-25 08:46:22,967 INFO L78 Accepts]: Start accepts. Automaton has 1355 states and 1849 transitions. Word has length 331 [2019-11-25 08:46:22,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:22,967 INFO L462 AbstractCegarLoop]: Abstraction has 1355 states and 1849 transitions. [2019-11-25 08:46:22,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:22,968 INFO L276 IsEmpty]: Start isEmpty. Operand 1355 states and 1849 transitions. [2019-11-25 08:46:22,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2019-11-25 08:46:22,974 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:22,974 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:22,974 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:22,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:22,975 INFO L82 PathProgramCache]: Analyzing trace with hash 762439870, now seen corresponding path program 1 times [2019-11-25 08:46:22,975 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:22,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863609572] [2019-11-25 08:46:22,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:23,157 INFO L134 CoverageAnalysis]: Checked inductivity of 1418 backedges. 869 proven. 0 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2019-11-25 08:46:23,157 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863609572] [2019-11-25 08:46:23,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:23,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:46:23,158 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045525836] [2019-11-25 08:46:23,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:23,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:23,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:23,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:23,159 INFO L87 Difference]: Start difference. First operand 1355 states and 1849 transitions. Second operand 3 states. [2019-11-25 08:46:23,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:23,211 INFO L93 Difference]: Finished difference Result 3852 states and 5281 transitions. [2019-11-25 08:46:23,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:23,212 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 332 [2019-11-25 08:46:23,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:23,225 INFO L225 Difference]: With dead ends: 3852 [2019-11-25 08:46:23,225 INFO L226 Difference]: Without dead ends: 2506 [2019-11-25 08:46:23,228 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:46:23,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2506 states. [2019-11-25 08:46:23,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2506 to 2504. [2019-11-25 08:46:23,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2504 states. [2019-11-25 08:46:23,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2504 states to 2504 states and 3435 transitions. [2019-11-25 08:46:23,296 INFO L78 Accepts]: Start accepts. Automaton has 2504 states and 3435 transitions. Word has length 332 [2019-11-25 08:46:23,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:23,296 INFO L462 AbstractCegarLoop]: Abstraction has 2504 states and 3435 transitions. [2019-11-25 08:46:23,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:23,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2504 states and 3435 transitions. [2019-11-25 08:46:23,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-11-25 08:46:23,304 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:23,304 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:23,304 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:23,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:23,305 INFO L82 PathProgramCache]: Analyzing trace with hash -1156712834, now seen corresponding path program 1 times [2019-11-25 08:46:23,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:23,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796136560] [2019-11-25 08:46:23,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:23,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 790 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-25 08:46:23,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796136560] [2019-11-25 08:46:23,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290888605] [2019-11-25 08:46:23,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cf28dfe5-697a-4053-97df-34f008469770/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:46:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:23,552 INFO L255 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:46:23,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:46:23,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1415 backedges. 728 proven. 0 refuted. 0 times theorem prover too weak. 687 trivial. 0 not checked. [2019-11-25 08:46:23,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:46:23,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-25 08:46:23,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459282891] [2019-11-25 08:46:23,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:23,866 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:23,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:23,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:46:23,866 INFO L87 Difference]: Start difference. First operand 2504 states and 3435 transitions. Second operand 3 states. [2019-11-25 08:46:23,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:23,940 INFO L93 Difference]: Finished difference Result 5826 states and 7988 transitions. [2019-11-25 08:46:23,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:23,941 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 342 [2019-11-25 08:46:23,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:23,959 INFO L225 Difference]: With dead ends: 5826 [2019-11-25 08:46:23,959 INFO L226 Difference]: Without dead ends: 3331 [2019-11-25 08:46:23,963 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 342 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:46:23,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3331 states. [2019-11-25 08:46:24,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3331 to 3331. [2019-11-25 08:46:24,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3331 states. [2019-11-25 08:46:24,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3331 states to 3331 states and 4560 transitions. [2019-11-25 08:46:24,061 INFO L78 Accepts]: Start accepts. Automaton has 3331 states and 4560 transitions. Word has length 342 [2019-11-25 08:46:24,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:24,062 INFO L462 AbstractCegarLoop]: Abstraction has 3331 states and 4560 transitions. [2019-11-25 08:46:24,062 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:24,062 INFO L276 IsEmpty]: Start isEmpty. Operand 3331 states and 4560 transitions. [2019-11-25 08:46:24,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2019-11-25 08:46:24,070 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:24,071 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:24,274 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:46:24,274 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:24,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:24,275 INFO L82 PathProgramCache]: Analyzing trace with hash 938688742, now seen corresponding path program 1 times [2019-11-25 08:46:24,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:24,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363885652] [2019-11-25 08:46:24,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:24,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:24,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 792 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-25 08:46:24,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363885652] [2019-11-25 08:46:24,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1375067003] [2019-11-25 08:46:24,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cf28dfe5-697a-4053-97df-34f008469770/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:46:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:24,548 INFO L255 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:46:24,555 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:46:24,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1417 backedges. 792 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-25 08:46:24,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:46:24,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-25 08:46:24,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504430277] [2019-11-25 08:46:24,638 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:46:24,638 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:24,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:46:24,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:46:24,638 INFO L87 Difference]: Start difference. First operand 3331 states and 4560 transitions. Second operand 4 states. [2019-11-25 08:46:25,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:25,063 INFO L93 Difference]: Finished difference Result 6603 states and 9028 transitions. [2019-11-25 08:46:25,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-25 08:46:25,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 344 [2019-11-25 08:46:25,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:25,088 INFO L225 Difference]: With dead ends: 6603 [2019-11-25 08:46:25,089 INFO L226 Difference]: Without dead ends: 4983 [2019-11-25 08:46:25,092 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 346 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:46:25,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4983 states. [2019-11-25 08:46:25,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4983 to 3683. [2019-11-25 08:46:25,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3683 states. [2019-11-25 08:46:25,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3683 states to 3683 states and 4980 transitions. [2019-11-25 08:46:25,248 INFO L78 Accepts]: Start accepts. Automaton has 3683 states and 4980 transitions. Word has length 344 [2019-11-25 08:46:25,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:25,248 INFO L462 AbstractCegarLoop]: Abstraction has 3683 states and 4980 transitions. [2019-11-25 08:46:25,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:46:25,249 INFO L276 IsEmpty]: Start isEmpty. Operand 3683 states and 4980 transitions. [2019-11-25 08:46:25,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2019-11-25 08:46:25,257 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:25,257 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:46:25,461 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:46:25,462 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:25,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:25,462 INFO L82 PathProgramCache]: Analyzing trace with hash 741254605, now seen corresponding path program 1 times [2019-11-25 08:46:25,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:25,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758758291] [2019-11-25 08:46:25,463 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:25,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-25 08:46:25,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758758291] [2019-11-25 08:46:25,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583573843] [2019-11-25 08:46:25,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cf28dfe5-697a-4053-97df-34f008469770/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:46:25,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:25,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:46:25,727 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:46:25,807 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-25 08:46:25,808 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:46:25,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-25 08:46:25,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714211094] [2019-11-25 08:46:25,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:46:25,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:25,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:46:25,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:46:25,810 INFO L87 Difference]: Start difference. First operand 3683 states and 4980 transitions. Second operand 4 states. [2019-11-25 08:46:26,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:26,176 INFO L93 Difference]: Finished difference Result 8481 states and 11469 transitions. [2019-11-25 08:46:26,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:46:26,177 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 370 [2019-11-25 08:46:26,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:26,212 INFO L225 Difference]: With dead ends: 8481 [2019-11-25 08:46:26,212 INFO L226 Difference]: Without dead ends: 4798 [2019-11-25 08:46:26,217 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 372 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:46:26,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4798 states. [2019-11-25 08:46:26,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4798 to 3841. [2019-11-25 08:46:26,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3841 states. [2019-11-25 08:46:26,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3841 states to 3841 states and 5140 transitions. [2019-11-25 08:46:26,323 INFO L78 Accepts]: Start accepts. Automaton has 3841 states and 5140 transitions. Word has length 370 [2019-11-25 08:46:26,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:26,324 INFO L462 AbstractCegarLoop]: Abstraction has 3841 states and 5140 transitions. [2019-11-25 08:46:26,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:46:26,324 INFO L276 IsEmpty]: Start isEmpty. Operand 3841 states and 5140 transitions. [2019-11-25 08:46:26,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2019-11-25 08:46:26,334 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:26,335 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:26,546 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:46:26,546 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:26,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:26,546 INFO L82 PathProgramCache]: Analyzing trace with hash 232077189, now seen corresponding path program 1 times [2019-11-25 08:46:26,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:26,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49863744] [2019-11-25 08:46:26,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:26,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-11-25 08:46:26,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49863744] [2019-11-25 08:46:26,805 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:46:26,805 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:46:26,805 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332523227] [2019-11-25 08:46:26,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:26,806 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:26,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:26,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:46:26,806 INFO L87 Difference]: Start difference. First operand 3841 states and 5140 transitions. Second operand 3 states. [2019-11-25 08:46:26,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:26,987 INFO L93 Difference]: Finished difference Result 7373 states and 9714 transitions. [2019-11-25 08:46:26,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:26,987 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 409 [2019-11-25 08:46:26,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:26,992 INFO L225 Difference]: With dead ends: 7373 [2019-11-25 08:46:26,993 INFO L226 Difference]: Without dead ends: 1985 [2019-11-25 08:46:26,998 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:46:27,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2019-11-25 08:46:27,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1893. [2019-11-25 08:46:27,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1893 states. [2019-11-25 08:46:27,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1893 states to 1893 states and 2533 transitions. [2019-11-25 08:46:27,038 INFO L78 Accepts]: Start accepts. Automaton has 1893 states and 2533 transitions. Word has length 409 [2019-11-25 08:46:27,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:27,038 INFO L462 AbstractCegarLoop]: Abstraction has 1893 states and 2533 transitions. [2019-11-25 08:46:27,038 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:27,038 INFO L276 IsEmpty]: Start isEmpty. Operand 1893 states and 2533 transitions. [2019-11-25 08:46:27,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-11-25 08:46:27,043 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:27,044 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 14, 14, 13, 13, 12, 12, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:27,044 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:27,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:27,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1256651121, now seen corresponding path program 1 times [2019-11-25 08:46:27,045 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:27,045 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059013990] [2019-11-25 08:46:27,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:27,240 INFO L134 CoverageAnalysis]: Checked inductivity of 2606 backedges. 1545 proven. 14 refuted. 0 times theorem prover too weak. 1047 trivial. 0 not checked. [2019-11-25 08:46:27,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059013990] [2019-11-25 08:46:27,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074207885] [2019-11-25 08:46:27,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cf28dfe5-697a-4053-97df-34f008469770/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:46:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:27,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 739 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-25 08:46:27,386 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:46:27,523 INFO L134 CoverageAnalysis]: Checked inductivity of 2606 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 2338 trivial. 0 not checked. [2019-11-25 08:46:27,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:46:27,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-25 08:46:27,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244896817] [2019-11-25 08:46:27,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:27,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:27,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:27,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:46:27,525 INFO L87 Difference]: Start difference. First operand 1893 states and 2533 transitions. Second operand 3 states. [2019-11-25 08:46:27,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:27,730 INFO L93 Difference]: Finished difference Result 3956 states and 5317 transitions. [2019-11-25 08:46:27,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:27,731 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 493 [2019-11-25 08:46:27,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:27,735 INFO L225 Difference]: With dead ends: 3956 [2019-11-25 08:46:27,735 INFO L226 Difference]: Without dead ends: 1991 [2019-11-25 08:46:27,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:46:27,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1991 states. [2019-11-25 08:46:27,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1991 to 1987. [2019-11-25 08:46:27,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1987 states. [2019-11-25 08:46:27,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 2576 transitions. [2019-11-25 08:46:27,776 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 2576 transitions. Word has length 493 [2019-11-25 08:46:27,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:27,777 INFO L462 AbstractCegarLoop]: Abstraction has 1987 states and 2576 transitions. [2019-11-25 08:46:27,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:27,777 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 2576 transitions. [2019-11-25 08:46:27,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2019-11-25 08:46:27,782 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:27,784 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:27,996 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:46:27,996 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:27,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:27,996 INFO L82 PathProgramCache]: Analyzing trace with hash 709390269, now seen corresponding path program 1 times [2019-11-25 08:46:27,996 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:27,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891175429] [2019-11-25 08:46:27,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:28,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:28,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1570 proven. 14 refuted. 0 times theorem prover too weak. 1127 trivial. 0 not checked. [2019-11-25 08:46:28,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891175429] [2019-11-25 08:46:28,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992018592] [2019-11-25 08:46:28,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cf28dfe5-697a-4053-97df-34f008469770/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:46:28,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:28,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 752 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:46:28,328 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:46:28,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1019 proven. 0 refuted. 0 times theorem prover too weak. 1692 trivial. 0 not checked. [2019-11-25 08:46:28,558 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-25 08:46:28,558 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-25 08:46:28,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766454473] [2019-11-25 08:46:28,559 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:46:28,559 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:28,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:46:28,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:46:28,560 INFO L87 Difference]: Start difference. First operand 1987 states and 2576 transitions. Second operand 3 states. [2019-11-25 08:46:28,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:28,589 INFO L93 Difference]: Finished difference Result 2038 states and 2641 transitions. [2019-11-25 08:46:28,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:46:28,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 493 [2019-11-25 08:46:28,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:28,593 INFO L225 Difference]: With dead ends: 2038 [2019-11-25 08:46:28,594 INFO L226 Difference]: Without dead ends: 1835 [2019-11-25 08:46:28,595 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 493 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:46:28,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1835 states. [2019-11-25 08:46:28,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1835 to 1786. [2019-11-25 08:46:28,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1786 states. [2019-11-25 08:46:28,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1786 states to 1786 states and 2314 transitions. [2019-11-25 08:46:28,637 INFO L78 Accepts]: Start accepts. Automaton has 1786 states and 2314 transitions. Word has length 493 [2019-11-25 08:46:28,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:28,638 INFO L462 AbstractCegarLoop]: Abstraction has 1786 states and 2314 transitions. [2019-11-25 08:46:28,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:46:28,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1786 states and 2314 transitions. [2019-11-25 08:46:28,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2019-11-25 08:46:28,647 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:46:28,647 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46:28,851 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:46:28,851 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:46:28,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:46:28,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1730430293, now seen corresponding path program 2 times [2019-11-25 08:46:28,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:46:28,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974769065] [2019-11-25 08:46:28,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:46:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:46:29,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked. [2019-11-25 08:46:29,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974769065] [2019-11-25 08:46:29,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [290648651] [2019-11-25 08:46:29,176 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cf28dfe5-697a-4053-97df-34f008469770/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:46:29,320 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-25 08:46:29,320 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-25 08:46:29,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 882 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-25 08:46:29,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-25 08:46:29,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3925 backedges. 2052 proven. 14 refuted. 0 times theorem prover too weak. 1859 trivial. 0 not checked. [2019-11-25 08:46:29,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-25 08:46:29,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-25 08:46:29,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776911392] [2019-11-25 08:46:29,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-25 08:46:29,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:46:29,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-25 08:46:29,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-25 08:46:29,532 INFO L87 Difference]: Start difference. First operand 1786 states and 2314 transitions. Second operand 4 states. [2019-11-25 08:46:29,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:46:29,702 INFO L93 Difference]: Finished difference Result 2046 states and 2645 transitions. [2019-11-25 08:46:29,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-25 08:46:29,703 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 603 [2019-11-25 08:46:29,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:46:29,704 INFO L225 Difference]: With dead ends: 2046 [2019-11-25 08:46:29,704 INFO L226 Difference]: Without dead ends: 0 [2019-11-25 08:46:29,706 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 605 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:46:29,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-25 08:46:29,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-25 08:46:29,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-25 08:46:29,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-25 08:46:29,707 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 603 [2019-11-25 08:46:29,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:46:29,707 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-25 08:46:29,707 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-25 08:46:29,708 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-25 08:46:29,708 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-25 08:46:29,908 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-25 08:46:29,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-25 08:46:30,361 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 103 [2019-11-25 08:46:30,558 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 30 [2019-11-25 08:46:30,737 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 24 [2019-11-25 08:46:31,053 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 27 [2019-11-25 08:46:31,328 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 7 [2019-11-25 08:46:31,447 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 37 DAG size of output: 29 [2019-11-25 08:46:32,173 WARN L192 SmtUtils]: Spent 650.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2019-11-25 08:46:32,281 INFO L444 ceAbstractionStarter]: For program point L366(lines 366 370) no Hoare annotation was computed. [2019-11-25 08:46:32,281 INFO L444 ceAbstractionStarter]: For program point L366-2(lines 366 370) no Hoare annotation was computed. [2019-11-25 08:46:32,281 INFO L444 ceAbstractionStarter]: For program point L565(lines 565 593) no Hoare annotation was computed. [2019-11-25 08:46:32,281 INFO L444 ceAbstractionStarter]: For program point L169(lines 169 540) no Hoare annotation was computed. [2019-11-25 08:46:32,282 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 551) no Hoare annotation was computed. [2019-11-25 08:46:32,282 INFO L444 ceAbstractionStarter]: For program point L103(lines 103 562) no Hoare annotation was computed. [2019-11-25 08:46:32,282 INFO L444 ceAbstractionStarter]: For program point L566(lines 566 590) no Hoare annotation was computed. [2019-11-25 08:46:32,282 INFO L444 ceAbstractionStarter]: For program point L500-1(lines 198 528) no Hoare annotation was computed. [2019-11-25 08:46:32,282 INFO L444 ceAbstractionStarter]: For program point L335(lines 335 340) no Hoare annotation was computed. [2019-11-25 08:46:32,282 INFO L444 ceAbstractionStarter]: For program point L302-1(lines 302 316) no Hoare annotation was computed. [2019-11-25 08:46:32,282 INFO L440 ceAbstractionStarter]: At program point L203(lines 100 563) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) [2019-11-25 08:46:32,282 INFO L440 ceAbstractionStarter]: At program point L170(lines 166 541) the Hoare annotation is: (let ((.cse1 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse3 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse3) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2 .cse3) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse2 .cse3))) [2019-11-25 08:46:32,282 INFO L444 ceAbstractionStarter]: For program point L600(lines 600 604) no Hoare annotation was computed. [2019-11-25 08:46:32,282 INFO L444 ceAbstractionStarter]: For program point L567(lines 567 576) no Hoare annotation was computed. [2019-11-25 08:46:32,283 INFO L444 ceAbstractionStarter]: For program point L600-2(lines 600 604) no Hoare annotation was computed. [2019-11-25 08:46:32,283 INFO L444 ceAbstractionStarter]: For program point L567-2(lines 566 588) no Hoare annotation was computed. [2019-11-25 08:46:32,283 INFO L444 ceAbstractionStarter]: For program point L270(lines 270 274) no Hoare annotation was computed. [2019-11-25 08:46:32,283 INFO L444 ceAbstractionStarter]: For program point L172(lines 172 539) no Hoare annotation was computed. [2019-11-25 08:46:32,283 INFO L444 ceAbstractionStarter]: For program point L139(lines 139 550) no Hoare annotation was computed. [2019-11-25 08:46:32,283 INFO L444 ceAbstractionStarter]: For program point L106(lines 106 561) no Hoare annotation was computed. [2019-11-25 08:46:32,283 INFO L444 ceAbstractionStarter]: For program point L569(lines 569 573) no Hoare annotation was computed. [2019-11-25 08:46:32,283 INFO L444 ceAbstractionStarter]: For program point L437(lines 437 442) no Hoare annotation was computed. [2019-11-25 08:46:32,283 INFO L440 ceAbstractionStarter]: At program point L140(lines 136 551) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4448)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse0 .cse1 .cse2))) [2019-11-25 08:46:32,283 INFO L444 ceAbstractionStarter]: For program point L74(lines 74 82) no Hoare annotation was computed. [2019-11-25 08:46:32,284 INFO L444 ceAbstractionStarter]: For program point L471(lines 471 475) no Hoare annotation was computed. [2019-11-25 08:46:32,284 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 310) no Hoare annotation was computed. [2019-11-25 08:46:32,284 INFO L444 ceAbstractionStarter]: For program point L306-2(lines 304 316) no Hoare annotation was computed. [2019-11-25 08:46:32,284 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 505 509) no Hoare annotation was computed. [2019-11-25 08:46:32,284 INFO L444 ceAbstractionStarter]: For program point L406(lines 406 410) no Hoare annotation was computed. [2019-11-25 08:46:32,284 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 212) no Hoare annotation was computed. [2019-11-25 08:46:32,284 INFO L444 ceAbstractionStarter]: For program point L175(lines 175 538) no Hoare annotation was computed. [2019-11-25 08:46:32,284 INFO L444 ceAbstractionStarter]: For program point L142(lines 142 549) no Hoare annotation was computed. [2019-11-25 08:46:32,284 INFO L444 ceAbstractionStarter]: For program point L208-2(lines 198 528) no Hoare annotation was computed. [2019-11-25 08:46:32,284 INFO L444 ceAbstractionStarter]: For program point L109(lines 109 560) no Hoare annotation was computed. [2019-11-25 08:46:32,284 INFO L440 ceAbstractionStarter]: At program point L176(lines 172 539) the Hoare annotation is: (let ((.cse3 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse5 (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse4 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse4 .cse2 .cse3) (and .cse5 .cse0 .cse1) (and .cse5 .cse0 .cse4 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-11-25 08:46:32,285 INFO L444 ceAbstractionStarter]: For program point L77(lines 77 81) no Hoare annotation was computed. [2019-11-25 08:46:32,285 INFO L444 ceAbstractionStarter]: For program point L77-2(lines 74 82) no Hoare annotation was computed. [2019-11-25 08:46:32,285 INFO L447 ceAbstractionStarter]: At program point L607(lines 7 609) the Hoare annotation is: true [2019-11-25 08:46:32,285 INFO L444 ceAbstractionStarter]: For program point L244(lines 244 249) no Hoare annotation was computed. [2019-11-25 08:46:32,285 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 537) no Hoare annotation was computed. [2019-11-25 08:46:32,285 INFO L444 ceAbstractionStarter]: For program point L145(lines 145 548) no Hoare annotation was computed. [2019-11-25 08:46:32,285 INFO L444 ceAbstractionStarter]: For program point L112(lines 112 559) no Hoare annotation was computed. [2019-11-25 08:46:32,285 INFO L444 ceAbstractionStarter]: For program point L476(lines 476 480) no Hoare annotation was computed. [2019-11-25 08:46:32,285 INFO L444 ceAbstractionStarter]: For program point L476-2(lines 476 480) no Hoare annotation was computed. [2019-11-25 08:46:32,285 INFO L440 ceAbstractionStarter]: At program point L146(lines 142 549) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4464)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2))) [2019-11-25 08:46:32,285 INFO L444 ceAbstractionStarter]: For program point L378(lines 378 382) no Hoare annotation was computed. [2019-11-25 08:46:32,285 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 349) no Hoare annotation was computed. [2019-11-25 08:46:32,286 INFO L444 ceAbstractionStarter]: For program point L279(lines 279 287) no Hoare annotation was computed. [2019-11-25 08:46:32,286 INFO L440 ceAbstractionStarter]: At program point L346(lines 60 608) the Hoare annotation is: false [2019-11-25 08:46:32,286 INFO L444 ceAbstractionStarter]: For program point L181(lines 181 536) no Hoare annotation was computed. [2019-11-25 08:46:32,286 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 547) no Hoare annotation was computed. [2019-11-25 08:46:32,286 INFO L444 ceAbstractionStarter]: For program point L115(lines 115 558) no Hoare annotation was computed. [2019-11-25 08:46:32,286 INFO L444 ceAbstractionStarter]: For program point L578(lines 578 584) no Hoare annotation was computed. [2019-11-25 08:46:32,286 INFO L444 ceAbstractionStarter]: For program point L512(lines 512 516) no Hoare annotation was computed. [2019-11-25 08:46:32,286 INFO L444 ceAbstractionStarter]: For program point L512-2(lines 512 516) no Hoare annotation was computed. [2019-11-25 08:46:32,286 INFO L440 ceAbstractionStarter]: At program point L182(lines 178 537) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse4 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse3 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse4 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse3) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse0 .cse1) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse4 .cse2 .cse3))) [2019-11-25 08:46:32,286 INFO L440 ceAbstractionStarter]: At program point L116(lines 112 559) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-25 08:46:32,286 INFO L444 ceAbstractionStarter]: For program point L447(lines 447 451) no Hoare annotation was computed. [2019-11-25 08:46:32,286 INFO L444 ceAbstractionStarter]: For program point L282(lines 282 286) no Hoare annotation was computed. [2019-11-25 08:46:32,286 INFO L444 ceAbstractionStarter]: For program point L282-2(lines 198 528) no Hoare annotation was computed. [2019-11-25 08:46:32,286 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 92) no Hoare annotation was computed. [2019-11-25 08:46:32,287 INFO L444 ceAbstractionStarter]: For program point L184(lines 184 535) no Hoare annotation was computed. [2019-11-25 08:46:32,287 INFO L444 ceAbstractionStarter]: For program point L151(lines 151 546) no Hoare annotation was computed. [2019-11-25 08:46:32,287 INFO L444 ceAbstractionStarter]: For program point L118(lines 118 557) no Hoare annotation was computed. [2019-11-25 08:46:32,287 INFO L444 ceAbstractionStarter]: For program point L85(lines 85 89) no Hoare annotation was computed. [2019-11-25 08:46:32,287 INFO L444 ceAbstractionStarter]: For program point L350(lines 350 354) no Hoare annotation was computed. [2019-11-25 08:46:32,287 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-25 08:46:32,287 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 484 496) no Hoare annotation was computed. [2019-11-25 08:46:32,287 INFO L444 ceAbstractionStarter]: For program point L418(lines 418 422) no Hoare annotation was computed. [2019-11-25 08:46:32,287 INFO L444 ceAbstractionStarter]: For program point L220(lines 220 237) no Hoare annotation was computed. [2019-11-25 08:46:32,287 INFO L444 ceAbstractionStarter]: For program point L187(lines 187 534) no Hoare annotation was computed. [2019-11-25 08:46:32,287 INFO L444 ceAbstractionStarter]: For program point L154(lines 154 545) no Hoare annotation was computed. [2019-11-25 08:46:32,287 INFO L444 ceAbstractionStarter]: For program point L220-2(lines 198 528) no Hoare annotation was computed. [2019-11-25 08:46:32,287 INFO L444 ceAbstractionStarter]: For program point L121(lines 121 556) no Hoare annotation was computed. [2019-11-25 08:46:32,287 INFO L440 ceAbstractionStarter]: At program point L188(lines 184 535) the Hoare annotation is: (let ((.cse0 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse3 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse4 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560))) (or (and (not .cse0) .cse1 .cse2 .cse3) (and .cse1 .cse2 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse4 .cse0 .cse5) (and .cse1 .cse2 .cse3 .cse4 .cse5))) [2019-11-25 08:46:32,287 INFO L440 ceAbstractionStarter]: At program point L122(lines 118 557) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-25 08:46:32,287 INFO L447 ceAbstractionStarter]: At program point L618(lines 610 620) the Hoare annotation is: true [2019-11-25 08:46:32,287 INFO L444 ceAbstractionStarter]: For program point L519(lines 519 523) no Hoare annotation was computed. [2019-11-25 08:46:32,287 INFO L444 ceAbstractionStarter]: For program point L222(lines 222 227) no Hoare annotation was computed. [2019-11-25 08:46:32,287 INFO L444 ceAbstractionStarter]: For program point L487(lines 487 492) no Hoare annotation was computed. [2019-11-25 08:46:32,288 INFO L444 ceAbstractionStarter]: For program point L454(lines 454 465) no Hoare annotation was computed. [2019-11-25 08:46:32,288 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 454 465) no Hoare annotation was computed. [2019-11-25 08:46:32,288 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-25 08:46:32,288 INFO L444 ceAbstractionStarter]: For program point L190(lines 190 533) no Hoare annotation was computed. [2019-11-25 08:46:32,288 INFO L444 ceAbstractionStarter]: For program point L157(lines 157 544) no Hoare annotation was computed. [2019-11-25 08:46:32,288 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 555) no Hoare annotation was computed. [2019-11-25 08:46:32,288 INFO L444 ceAbstractionStarter]: For program point L389(lines 389 393) no Hoare annotation was computed. [2019-11-25 08:46:32,288 INFO L444 ceAbstractionStarter]: For program point L323(lines 323 327) no Hoare annotation was computed. [2019-11-25 08:46:32,288 INFO L444 ceAbstractionStarter]: For program point L323-2(lines 198 528) no Hoare annotation was computed. [2019-11-25 08:46:32,288 INFO L440 ceAbstractionStarter]: At program point L191(lines 190 533) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse5 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse3 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560))) (or (and .cse0 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse1 .cse2 .cse3 .cse4) (and (not .cse3) .cse0 .cse5 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse1) (and .cse0 .cse5 .cse1 .cse2 .cse3 .cse4))) [2019-11-25 08:46:32,288 INFO L440 ceAbstractionStarter]: At program point L158(lines 148 547) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4480)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse1 .cse2))) [2019-11-25 08:46:32,288 INFO L444 ceAbstractionStarter]: For program point L456(lines 456 462) no Hoare annotation was computed. [2019-11-25 08:46:32,289 INFO L444 ceAbstractionStarter]: For program point L258(lines 258 262) no Hoare annotation was computed. [2019-11-25 08:46:32,291 INFO L444 ceAbstractionStarter]: For program point L258-2(lines 198 528) no Hoare annotation was computed. [2019-11-25 08:46:32,292 INFO L444 ceAbstractionStarter]: For program point L193(lines 193 532) no Hoare annotation was computed. [2019-11-25 08:46:32,292 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 543) no Hoare annotation was computed. [2019-11-25 08:46:32,292 INFO L444 ceAbstractionStarter]: For program point L127(lines 127 554) no Hoare annotation was computed. [2019-11-25 08:46:32,292 INFO L444 ceAbstractionStarter]: For program point L94-1(lines 60 608) no Hoare annotation was computed. [2019-11-25 08:46:32,292 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-25 08:46:32,292 INFO L444 ceAbstractionStarter]: For program point L293(lines 293 297) no Hoare annotation was computed. [2019-11-25 08:46:32,292 INFO L444 ceAbstractionStarter]: For program point L293-2(lines 293 297) no Hoare annotation was computed. [2019-11-25 08:46:32,292 INFO L447 ceAbstractionStarter]: At program point L194(lines 193 532) the Hoare annotation is: true [2019-11-25 08:46:32,293 INFO L440 ceAbstractionStarter]: At program point L128(lines 124 555) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse0 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-11-25 08:46:32,293 INFO L444 ceAbstractionStarter]: For program point L95(line 95) no Hoare annotation was computed. [2019-11-25 08:46:32,293 INFO L444 ceAbstractionStarter]: For program point L426(lines 426 430) no Hoare annotation was computed. [2019-11-25 08:46:32,293 INFO L444 ceAbstractionStarter]: For program point L426-2(lines 198 528) no Hoare annotation was computed. [2019-11-25 08:46:32,293 INFO L444 ceAbstractionStarter]: For program point L228(lines 228 233) no Hoare annotation was computed. [2019-11-25 08:46:32,293 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 365) no Hoare annotation was computed. [2019-11-25 08:46:32,294 INFO L444 ceAbstractionStarter]: For program point L163(lines 163 542) no Hoare annotation was computed. [2019-11-25 08:46:32,294 INFO L444 ceAbstractionStarter]: For program point L130(lines 130 553) no Hoare annotation was computed. [2019-11-25 08:46:32,294 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 564) no Hoare annotation was computed. [2019-11-25 08:46:32,294 INFO L444 ceAbstractionStarter]: For program point L395(lines 395 400) no Hoare annotation was computed. [2019-11-25 08:46:32,294 INFO L444 ceAbstractionStarter]: For program point L395-2(lines 395 400) no Hoare annotation was computed. [2019-11-25 08:46:32,294 INFO L447 ceAbstractionStarter]: At program point L197(lines 196 531) the Hoare annotation is: true [2019-11-25 08:46:32,294 INFO L440 ceAbstractionStarter]: At program point L164(lines 160 543) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512)) (.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse1 .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse1 .cse2))) [2019-11-25 08:46:32,295 INFO L440 ceAbstractionStarter]: At program point L98(lines 97 564) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (= 12292 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-25 08:46:32,295 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 606) no Hoare annotation was computed. [2019-11-25 08:46:32,295 INFO L440 ceAbstractionStarter]: At program point L529(lines 94 595) the Hoare annotation is: (let ((.cse6 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (let ((.cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse3 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse10 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse4 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse5 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0)) (.cse1 (not .cse6)) (.cse16 (= 4416 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse14 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse15 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse9 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse7 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse12 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse8 (= 4400 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse13 (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse11 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2))) (or (and .cse0 (= 4368 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse1 .cse2 .cse3 .cse0) (and .cse4 .cse5 .cse6 .cse7 .cse8) (and .cse2 .cse3 .cse5 .cse9 .cse6 .cse7) (and .cse10 .cse5 .cse7) (and .cse0 .cse10 .cse6) (and .cse2 .cse3 .cse0 .cse9 .cse7) (and .cse11 .cse4 .cse5 .cse6 .cse12) (and .cse13 .cse11 .cse5 .cse6 .cse7) (and .cse14 .cse5 .cse15 .cse9 .cse6 .cse7) (and .cse0 .cse10 .cse7) (and .cse16 .cse4 .cse5 .cse6) (and .cse1 .cse14 .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse15) (and .cse0 (= 4384 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse16 .cse0 .cse6) (and .cse14 .cse0 .cse15 .cse9 .cse6 .cse7) (and .cse11 .cse0 .cse6 .cse12) (and .cse0 .cse6 .cse8) (and .cse13 .cse11 .cse0)))) [2019-11-25 08:46:32,295 INFO L444 ceAbstractionStarter]: For program point L166(lines 166 541) no Hoare annotation was computed. [2019-11-25 08:46:32,296 INFO L444 ceAbstractionStarter]: For program point L133(lines 133 552) no Hoare annotation was computed. [2019-11-25 08:46:32,296 INFO L444 ceAbstractionStarter]: For program point L100(lines 100 563) no Hoare annotation was computed. [2019-11-25 08:46:32,296 INFO L447 ceAbstractionStarter]: At program point L596(lines 93 597) the Hoare annotation is: true [2019-11-25 08:46:32,296 INFO L440 ceAbstractionStarter]: At program point L134(lines 130 553) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse0 (<= (mod (+ ULTIMATE.start_ssl3_connect_~s__s3__tmp__new_cipher__algorithms~0 256) 4294967296) 0) .cse1 .cse2))) [2019-11-25 08:46:32,346 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:46:32 BoogieIcfgContainer [2019-11-25 08:46:32,351 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:46:32,351 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:46:32,351 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:46:32,352 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:46:32,352 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:46:17" (3/4) ... [2019-11-25 08:46:32,355 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-25 08:46:32,386 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-25 08:46:32,389 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-25 08:46:32,493 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_cf28dfe5-697a-4053-97df-34f008469770/bin/uautomizer/witness.graphml [2019-11-25 08:46:32,493 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:46:32,495 INFO L168 Benchmark]: Toolchain (without parser) took 16097.29 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 972.6 MB). Free memory was 944.8 MB in the beginning and 1.5 GB in the end (delta: -578.0 MB). Peak memory consumption was 394.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:46:32,495 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:46:32,495 INFO L168 Benchmark]: CACSL2BoogieTranslator took 415.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 944.8 MB in the beginning and 1.2 GB in the end (delta: -214.6 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:46:32,496 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:46:32,496 INFO L168 Benchmark]: Boogie Preprocessor took 68.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:46:32,496 INFO L168 Benchmark]: RCFGBuilder took 823.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 47.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:46:32,497 INFO L168 Benchmark]: TraceAbstraction took 14568.31 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 803.7 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -446.2 MB). Peak memory consumption was 855.0 MB. Max. memory is 11.5 GB. [2019-11-25 08:46:32,498 INFO L168 Benchmark]: Witness Printer took 142.04 ms. Allocated memory is still 2.0 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-11-25 08:46:32,499 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 415.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 168.8 MB). Free memory was 944.8 MB in the beginning and 1.2 GB in the end (delta: -214.6 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.25 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 68.92 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 823.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 47.4 MB). Peak memory consumption was 47.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 14568.31 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 803.7 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -446.2 MB). Peak memory consumption was 855.0 MB. Max. memory is 11.5 GB. * Witness Printer took 142.04 ms. Allocated memory is still 2.0 GB. Free memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 606]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 118]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 196]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: (((((s__state <= 4528 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state) || ((((s__state <= 4528 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state)) || ((4512 <= s__state && s__state <= 4528) && blastFlag <= 2)) || ((((4512 <= s__state && s__state <= 4528) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 130]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) || ((((blastFlag <= 4 && s__state <= 4432) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4352 <= s__state) && 0 == s__hit) - InvariantResult [Line: 184]: Loop Invariant Derived loop invariant: ((((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2) || (((((4560 <= s__state && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((((4560 <= s__state && s__state <= 4560) && blastFlag <= 2) && 4560 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 142]: Loop Invariant Derived loop invariant: ((((s__state <= 4464 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state) || (((s__state <= 4464 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state) - InvariantResult [Line: 148]: Loop Invariant Derived loop invariant: (((s__state <= 4480 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state) || ((((s__state <= 4480 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state) - InvariantResult [Line: 610]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 190]: Loop Invariant Derived loop invariant: ((((((s__state <= 4352 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) || ((((!(0 == s__hit) && s__state <= 4352) && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state)) || (((((s__state <= 4352 && blastFlag <= 2) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 166]: Loop Invariant Derived loop invariant: (((((s__state <= 4512 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4432 <= s__state) || ((((s__state <= 4512 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state)) || (((s__state <= 4512 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state) - InvariantResult [Line: 124]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) || (((((blastFlag <= 4 && s__state <= 4432) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4352 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 100]: Loop Invariant Derived loop invariant: s__state <= 4560 && blastFlag <= 2 - InvariantResult [Line: 178]: Loop Invariant Derived loop invariant: (((((s__state <= 4560 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state) || ((((s__state <= 4560 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4432 <= s__state)) || ((4512 <= s__state && s__state <= 4560) && blastFlag <= 2)) || ((((s__state <= 4560 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state) - InvariantResult [Line: 136]: Loop Invariant Derived loop invariant: (((blastFlag <= 2 && s__state <= 4448) && 0 == s__hit) && 4432 <= s__state) || ((((blastFlag <= 4 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && s__state <= 4448) && 0 == s__hit) && 4432 <= s__state) - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: blastFlag <= 2 && 12292 == s__state - InvariantResult [Line: 94]: Loop Invariant Derived loop invariant: ((((((((((((((((((blastFlag <= 2 && 4368 == s__state) || (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2)) || ((((blastFlag <= 4 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4400 == s__state)) || (((((4560 <= s__state && s__state <= 4560) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((s__state <= 3 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && s__s3__tmp__next_state___0 <= 4560)) || ((blastFlag <= 2 && s__state <= 3) && 0 == s__hit)) || ((((4560 <= s__state && s__state <= 4560) && blastFlag <= 2) && 4560 <= s__s3__tmp__next_state___0) && s__s3__tmp__next_state___0 <= 4560)) || ((((s__state <= 4528 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state)) || ((((4512 <= s__state && s__state <= 4528) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || (((((s__state <= 4352 && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((blastFlag <= 2 && s__state <= 3) && s__s3__tmp__next_state___0 <= 4560)) || (((4416 == s__state && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit)) || ((((!(0 == s__hit) && s__state <= 4352) && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state)) || (blastFlag <= 2 && 4384 == s__state)) || ((4416 == s__state && blastFlag <= 2) && 0 == s__hit)) || (((((s__state <= 4352 && blastFlag <= 2) && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || (((s__state <= 4528 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state)) || ((blastFlag <= 2 && 0 == s__hit) && 4400 == s__state)) || ((4512 <= s__state && s__state <= 4528) && blastFlag <= 2) - InvariantResult [Line: 193]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 160]: Loop Invariant Derived loop invariant: ((((s__state <= 4512 && blastFlag <= 4) && (s__s3__tmp__new_cipher__algorithms + 256) % 4294967296 <= 0) && 0 == s__hit) && 4432 <= s__state) || (((s__state <= 4512 && blastFlag <= 2) && 0 == s__hit) && 4432 <= s__state) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 123 locations, 1 error locations. Result: SAFE, OverallTime: 14.4s, OverallIterations: 25, TraceHistogramMax: 21, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.3s, HoareTripleCheckerStatistics: 4391 SDtfs, 2019 SDslu, 2246 SDs, 0 SdLazy, 2459 SolverSat, 611 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2725 GetRequests, 2688 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3841occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 25 MinimizatonAttempts, 2798 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 127 NumberOfFragments, 824 HoareAnnotationTreeSize, 22 FomulaSimplifications, 30206 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 22 FomulaSimplificationsInter, 24380 FormulaSimplificationTreeSizeReductionInter, 1.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 8751 NumberOfCodeBlocks, 8751 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 8720 ConstructedInterpolants, 0 QuantifiedInterpolants, 4981326 SizeOfPredicates, 8 NumberOfNonLiveVariables, 4110 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 31 InterpolantComputations, 22 PerfectInterpolantSequences, 39090/39192 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 correct! Received shutdown request...